Cryptographic and physical zero-knowledge proof: from Sudoku to nonogram

Authors:
Yu-Feng Chien;Wing-Kai Hon
Affiliations:
Department of Computer Science, National Tsing Hua University;Department of Computer Science, National Tsing Hua University
Venue:
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Year:
2010

Citing 5
Cited 0

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles

Theory of Computing Systems
Basing cryptographic protocols on tamper-evident seals

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gradwohl et al. (2007) gave a zero-knowledge proof for Sudoku that can be implemented physically using common tools like envelopes and bags, and the procedures are so simple that they can be executed solely by kids. In this paper, we work along with this direction, and first propose some simple physical zero-knowledge proofs for Nonogram (which was a very popular puzzle game in the 1990s).