Two standard decks of playing cards are sufficient for a ZKP for Sudoku
From MaRDI portal
Publication:2695333
DOI10.1007/978-3-030-89543-3_52OpenAlexW3210292532MaRDI QIDQ2695333
Publication date: 30 March 2023
Full work available at URL: https://arxiv.org/abs/2106.13646
Related Items (8)
An improved physical ZKP for Nonogram ⋮ Card-minimal protocols for three-input functions with standard playing cards ⋮ Physical zero-knowledge proof protocol for Topswops ⋮ Hide a liar: card-based ZKP protocol for Usowan ⋮ Physical zero-knowledge proof for ball sort puzzle ⋮ Secure computations through checking suits of playing cards ⋮ An improved physical ZKP for nonogram and nonogram color ⋮ Card-based zero-knowledge proof protocols for graph problems and their computational model
Cites Work
- Efficient and secure multiparty computations using a standard deck of playing cards
- A secure three-input and protocol with a standard deck of minimal cards
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
- 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
- Practical card-based implementations of Yao's millionaire protocol
- Interactive physical zero-knowledge proof for Norinori
- The Knowledge Complexity of Interactive Proof Systems
- Physical zero-knowledge proof for ripple effect
- Physical zero-knowledge proof for Makaro
- Unnamed Item
- Unnamed Item
This page was built for publication: Two standard decks of playing cards are sufficient for a ZKP for Sudoku
