Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
From MaRDI portal
Publication:2117799
Recommendations
Cites work
- A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
- Card-based ZKP protocols for Takuzu and Juosan
- Computational complexity of NURIKABE
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Efficient card-based zero-knowledge proof for Sudoku
- Foundations for actively secure card-based cryptography
- Games, puzzles, and computation
- How to construct constant-round zero-knowledge proof systems for NP
- Interactive physical zero-knowledge proof for Norinori
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Physical Zero-Knowledge Proof for Suguru Puzzle
- Physical zero-knowledge proof for Makaro
- Physical zero-knowledge proof for ripple effect
- Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The knowledge complexity of interactive proof-systems
Cited in
(19)- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
- Card-based cryptographic protocols for three-input functions using private operations
- Physical zero-knowledge proof for ball sort puzzle
- Physical ZKP protocols for Nurimisaki and Kurodoko
- An improved physical ZKP for Nonogram
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
- Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
- 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
- Card-based ZKP protocol for Nurimisaki
- Card-Based Secure Sorting Protocol
- Card-minimal protocols for three-input functions with standard playing cards
- Physical ZKP for Makaro using a standard deck of cards
- Card-based zero-knowledge proof protocols for graph problems and their computational model
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
- Physically verifying the first nonzero term in a sequence: physical ZKPs for ABC End View and Goishi Hiroi
- Two UNO decks efficiently perform zero-knowledge proof for Sudoku
- Card-based cryptographic protocols with a standard deck of cards using private operations
This page was built for publication: Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117799)
