Two UNO decks efficiently perform zero-knowledge proof for Sudoku
From MaRDI portal
(Redirected from Publication:6546608)
Cites work
- A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
- Card-based cryptographic protocols using a minimal number of cards
- Card-based zero-knowledge proof for Sudoku
- Card-based zero-knowledge proof protocols for graph problems and their computational model
- Card-based ZKP protocols for Takuzu and Juosan
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Efficient card-based protocols for generating a hidden random permutation without fixed points
- Efficient card-based zero-knowledge proof for Sudoku
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Physical zero-knowledge proof for Makaro
- Physical zero-knowledge proof for Numberlink
- Physical Zero-Knowledge Proof for Suguru Puzzle
- Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
- Physical ZKP for Makaro using a standard deck of cards
- The knowledge complexity of interactive proof-systems
- The minimum number of cards in practical card-based protocols
- Towards user-friendly cryptography
- Two standard decks of playing cards are sufficient for a ZKP for Sudoku
This page was built for publication: Two UNO decks efficiently perform zero-knowledge proof for Sudoku
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546608)
