Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
From MaRDI portal
Publication:2117799
DOI10.1007/978-3-030-80049-9_37OpenAlexW3172292332MaRDI QIDQ2117799
Takaaki Mizuki, Daiki Miyahara, Pascal Lafourcade, Léo Robert
Publication date: 22 March 2022
Full work available at URL: https://hal.uca.fr/hal-03209911/file/main_long.pdf
Related Items (16)
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 ⋮ An improved physical ZKP for Nonogram ⋮ Zero-knowledge proof protocol for cryptarithmetic using dihedral cards ⋮ Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems ⋮ Physical ZKP protocols for Nurimisaki and Kurodoko ⋮ Card-minimal protocols for three-input functions with standard playing cards ⋮ Physical zero-knowledge proof protocol for Topswops ⋮ Physical ZKP for Makaro using a standard deck of cards ⋮ Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view ⋮ Physical zero-knowledge proof for ball sort puzzle ⋮ Card-based ZKP protocol for Nurimisaki ⋮ Two standard decks of playing cards are sufficient for a ZKP for Sudoku ⋮ Card-based zero-knowledge proof protocols for graph problems and their computational model ⋮ Physical zero-knowledge proof for ripple effect ⋮ Card-based cryptographic protocols for three-input functions using private operations
Cites Work
- Unnamed Item
- Unnamed Item
- How to construct constant-round zero-knowledge proof systems for NP
- A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
- Efficient card-based zero-knowledge proof for Sudoku
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Interactive physical zero-knowledge proof for Norinori
- Computational Complexity of NURIKABE
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The knowledge complexity of interactive proof-systems
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Physical zero-knowledge proof for ripple effect
- Physical zero-knowledge proof for Makaro
This page was built for publication: Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
