Physical Zero-Knowledge Proof and NP-completeness Proof of Suguru Puzzle ⋆ - Université Clermont Auvergne Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2022

Physical Zero-Knowledge Proof and NP-completeness Proof of Suguru Puzzle ⋆

Résumé

Suguru is a paper and pencil puzzle invented by Naoki Inaba. The goal of the game is to fill a grid with numbers between 1 and 5 while respecting three simple constraints. We first prove the NP-completeness of Suguru puzzle. For this we design gadgets to encode the PLANAR-CIRCUIT-SAT in a Suguru grid. We then design a physical Zero-Knowledge Proof (ZKP) protocol for Suguru. This ZKP protocol allows a prover to prove that he knows a solution of a Suguru grid to a verifier without leaking any information on the solution. To construct such a physical ZKP protocol, we only rely on a few physical cards and adapted encoding. For a Suguru grid with n cells, we only use 5n + 5 cards. Moreover, we prove the three classical security properties of a ZKP: completeness, extractability, and zero-knowledge.
Fichier principal
Vignette du fichier
main.pdf (455.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

Léo Robert, Daiki Miyahara, Pascal Lafourcade, Luc Libralesso, Takaaki Mizuki. Physical Zero-Knowledge Proof and NP-completeness Proof of Suguru Puzzle ⋆. Information and Computation, In press, ⟨10.1016/j.ic.2021.104858⟩. ⟨hal-03542495⟩
75 Consultations
118 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More