Card-Based ZKP for Connectivity: Applications to Nurikabe, Hitori, and Heyawake - Université Clermont Auvergne Accéder directement au contenu
Article Dans Une Revue New Generation Computing Année : 2022

Card-Based ZKP for Connectivity: Applications to Nurikabe, Hitori, and Heyawake

Résumé

During the last years, several card-based Zero-Knowledge Proof (ZKP) protocols for Nikoli's puzzles have been designed. Although there are relatively simple card-based ZKP protocols for a number of puzzles, such as Sudoku and Kakuro, some puzzles face difficulties in designing simple protocols. For example, Slitherlink requires novel and elaborate techniques to construct a protocol. In this study, we focus on three Nikoli puzzles: Nurikabe, Hitori, and Heyawake. To date, no cardbased ZKP protocol for these puzzles has been developed, partially because they have a relatively tricky rule that colored cells should form a connected area (namely, a polyomino); this rule, sometimes referred to as "Bundan-kin" (in Japanese), complicates the puzzles, as well as facilitating difficulties in designing card-based ZKP protocols.
Fichier principal
Vignette du fichier
main.pdf (505.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03542477 , version 1 (25-01-2022)

Licence

Paternité

Identifiants

  • HAL Id : hal-03542477 , version 1

Citer

Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki. Card-Based ZKP for Connectivity: Applications to Nurikabe, Hitori, and Heyawake. New Generation Computing, 2022. ⟨hal-03542477⟩
65 Consultations
69 Téléchargements

Partager

Gmail Facebook X LinkedIn More