How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2021

How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition

Abstract

We propose a technique to construct physical Zero-Knowledge Proof (ZKP) protocols for puzzles that require a single loop draw feature. Our approach is based on the observation that a loop has only one hole and this property remains stable by some simple transformations. Using this trick, we can transform a simple big loop, which is visible to anyone, into the solution loop by using transformations that do not disclose any information about the solution. We illustrate our technique by applying it to construct physical ZKP protocols for two Nikoli puzzles: Slitherlink and Masyu.
Fichier principal
Vignette du fichier
1-s2.0-S0304397521004242-main.pdf (476.23 Ko) Télécharger le fichier
Origin : Publication funded by an institution

Dates and versions

hal-03419470 , version 1 (08-11-2021)

Identifiers

Cite

Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Léo Robert, Tatsuya Sasaki, et al.. How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition. Theoretical Computer Science, 2021, 888, pp.41 - 55. ⟨10.1016/j.tcs.2021.07.019⟩. ⟨hal-03419470⟩
23 View
34 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More