Single-Shuffle Physical Zero-Knowledge Proof for Sudoku Using Interactive Inputs
A zero-knowledge proof (ZKP) is an interactive proof between a prover and a verifier, with the prover's goal to convince the verifier that a solution of a computation problem exists without revealing any information about the solution itself. A card-based physical ZKP is an implementation of a ZKP using physical cards. Several metrics are used to measure the efficiency of card-based ZKPs, such as the numbers of required cards and shuffles. In this paper, we propose the first card-based ZKP for a puzzle Sudoku that uses only one shuffle. To achieve this, we use a technique of applying private operations interactively to prepare inputs for the protocol.
Authors
- Yoshiki Abe (ORCID: https://orcid.org/0009-0002-3135-4488)
- Suthee Ruangwises (ORCID: https://orcid.org/0000-0002-2820-1301)
- Mitsugu Iwamoto (ORCID: https://orcid.org/0000-0003-1092-8489)
- Kyosuke Hatsugai
- Tomoki Ono (ORCID: https://orcid.org/0009-0002-5277-5900)
Institutions
- Chulalongkorn University (TH)
- University of Electro-Communications (JP)
Publication Details
- Published
- 2025-06-06
- DOI
- https://doi.org/10.1145/3709015.3728664
- Citations
- 1
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.73