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).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cook, S.: The Complexity of Theorem Proving Procedures. In: Proceedings of ACM Symposium on the Theory of Computing (STOC), pp. 151–158 (1971)
Fischer, M., Wright, R.: Bounds on Secret Key Exchange Using a Random Deal of Cards. Journal of Cryptology 9(2), 71–99 (1996)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)
Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But their Validity, and a Methodology of Cryptographic Protocol Design. Journal of the ACM 38(3), 691–729 (1991)
Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems (1985)
Gradwohl, R., Naor, M., Pinkas, B., Rothblum, G.: Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Theory of Computing Systems 44(2), 245–268 (2009)
Kaye, R.: Minesweeper is NP-complete. Mathematical Intelligencer 22(2), 9–15 (2000)
Moran, T., Naor, M.: Basing Cryptographic Protocols on Tamper-Evident Seals. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 285–297. Springer, Heidelberg (2005)
Naor, M.: Bit Commitment Using Pseudo-Randomness. Journal of Cryptology 4(2), 151–158 (1991)
Ueda, N., Nagao, T.: NP-completeness Results for Nonogram via Parsimonious Reductions. Technical Report TR96-0008, Department of Computer Science, Tokyo Institute of Technology (1996)
Wikipedia. Nonogram, http://en.wikipedia.org/wiki/Nonogram
Yato, T.: Complexity and Completeness of Finding Another Solution and its Application to Puzzles. Master’s thesis, University of Tokyo, Department of Information Science (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chien, YF., Hon, WK. (2010). Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)