2000 character limit reached
Printing Protocol: Physical ZKPs for Decomposition Puzzles
Published 2 Feb 2023 in cs.CR | (2302.01235v6)
Abstract: Decomposition puzzles are pencil-and-paper logic puzzles that involve partitioning a rectangular grid into several regions to satisfy certain rules. In this paper, we construct a generic card-based protocol called printing protocol, which can be used to physically verify solutions of decompositon puzzles. We apply the printing protocol to develop card-based zero-knowledge proof protocols for two such puzzles: Five Cells and Meadows. These protocols allow a prover to physically show that he/she knows solutions of the puzzles without revealing them.
- Y.-F. Chien and W.-K. Hon. Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram. In Proceedings of the 5th International Conference on Fun with Algorithms (FUN), pp. 102–112 (2010).
- C. Iwamoto and T. Ide. Five Cells and Tilepaint are NP-Complete. IEICE Trans. Inf. & Syst., 105.D(3): 508–516 (2022).
- A. Janko and O. Janko. Meadows. https://www.janko.at/Raetsel/Meadows/index.htm
- A. Koch and S. Walzer. Foundations for Actively Secure Card-Based Cryptography. In Proceedings of the 10th International Conference on Fun with Algorithms (FUN), pp. 17:1–17:23 (2020).
- P. Lafourcade, D. Miyahara, T. Mizuki, L. Robert, T. Sasaki and H. Sone. How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition. Theoretical Computer Science, 888: 41–55 (2021).
- Nikoli: Five Cells. https://www.nikoli.co.jp/en/puzzles/five_cells/
- S. Ruangwises. An Improved Physical ZKP for Nonogram and Nonogram Color. Journal of Combinatorial Optimization, 45(5): 122 (2023).
- S. Ruangwises. Physical Zero-Knowledge Proof for Ball Sort Puzzle. In Proceedings of the 19th Conference on Computability in Europe (CiE), pp. 246–257 (2023).
- S. Ruangwises. Physical Zero-Knowledge Proofs for Five Cells. In Proceedings of the 8th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT), pp. 315–330 (2023).
- S. Ruangwises. Physically Verifying the First Nonzero Term in a Sequence: Physical ZKPs for ABC End View and Goishi Hiroi. In Proceedings of the 17th Conference on Frontiers of Algorithmic Wisdom (FAW), pp. 171–183 (2023).
- S. Ruangwises. Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku. New Generation Computing, 40(1): 49–65 (2022).
- S. Ruangwises and T. Itoh. How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. In Proceedings of the 11th International Conference on Fun with Algorithms (FUN), pp. 24:1–24:12 (2022).
- S. Ruangwises and T. Itoh. Physical Zero-Knowledge Proof for Numberlink Puzzle and k𝑘kitalic_k Vertex-Disjoint Paths Problem. New Generation Computing, 39(1): 3–17 (2021).
- S. Ruangwises and T. Itoh. Physical Zero-Knowledge Proof for Ripple Effect. Theoretical Computer Science, 895: 115–123 (2021).
- S. Ruangwises and T. Itoh. Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems. In Proceedings of the 19th International Conference on Unconventional Computation and Natural Computation (UCNC), pp. 149–163 (2021).
- S. Ruangwises and T. Itoh. Physical ZKP for Makaro Using a Standard Deck of Cards. In Proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation (TAMC), pp. 43–54 (2022).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
