Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
From MaRDI portal
Publication:2272198
DOI10.1007/s00224-008-9119-9zbMath1179.68055OpenAlexW2102905434WikidataQ125870495 ScholiaQ125870495MaRDI QIDQ2272198
Benny Pinkas, Ronen Gradwohl, Guy N. Rothblum, Moni Naor
Publication date: 6 August 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9119-9
Related Items (21)
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 ⋮ Card-Based Zero-Knowledge Proof for Sudoku ⋮ Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ Physical ZKP protocols for Nurimisaki and Kurodoko ⋮ Physical ZKP for Makaro using a standard deck of cards ⋮ Hide a liar: card-based ZKP protocol for Usowan ⋮ 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 ⋮ Efficient card-based zero-knowledge proof for Sudoku ⋮ Card-based ZKP protocol for Nurimisaki ⋮ Secure computations through checking suits of playing cards ⋮ An improved physical ZKP for nonogram and nonogram color ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ 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 ⋮ Efficient generation of a card-based uniformly distributed random derangement ⋮ Physical zero-knowledge proof for ripple effect ⋮ Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
Cites Work
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Private computation using a PEZ dispenser.
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
- Automata, Languages and Programming
This page was built for publication: Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
