A physical ZKP for Slitherlink: how to perform physical topology-preserving computation

DOI10.1007/978-3-030-34339-2_8zbMath1497.68388OpenAlexW2990908920MaRDI QIDQ2169919

Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone, Tatsuya Sasaki

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-34339-2_8

physical zero-knowledge proof Slitherlink physical topology-preserving computation

Games involving graphs (91A43) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

Related Items (10)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Zero-knowledge proof protocol for cryptarithmetic using dihedral cards ⋮ Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems ⋮ Physical zero-knowledge proof protocol for Topswops ⋮ Two standard decks of playing cards are sufficient for a ZKP for Sudoku ⋮ Physical zero-knowledge proof for ripple effect ⋮ Physical zero-knowledge proof for ripple effect ⋮ Card-based cryptographic protocols for three-input functions using private operations ⋮ Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori

This page was built for publication: A physical ZKP for Slitherlink: how to perform physical topology-preserving computation