2008
DOI: 10.1007/s00224-008-9119-9
|View full text |Cite
|
Sign up to set email alerts
|

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 54 publications
(23 citation statements)
references
References 11 publications
0
23
0
Order By: Relevance
“…Proof. We use the same proof technique as in [8]: zero-knowledge is induced by a description of an efficient simulator which simulates interaction between a cheating verifier and a real prover. However, the simulator does not have a solution but it can swap cards for different ones during shuffles.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Proof. We use the same proof technique as in [8]: zero-knowledge is induced by a description of an efficient simulator which simulates interaction between a cheating verifier and a real prover. However, the simulator does not have a solution but it can swap cards for different ones during shuffles.…”
Section: Discussionmentioning
confidence: 99%
“…Related Work: Efficient physical ZKP protocols for Nikoli puzzles have been proposed: Sudoku [8,17], Akari [2], Takuzu [2,13], Kakuro [2,14], Kenken [2], Makaro [3], Norinori [4], Slitherlink [12], Juosan [13], and Numberlink [16]. An important step in this line of research is to achieve no soundness error.…”
Section: Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Besides Makaro, card-based ZKP protocols for many other logic puzzles have also been developed: Sudoku [6,26], Nonogram [3,21], Akari [1], Takuzu [1,14], Kakuro [1,15], KenKen [1], Norinori [4], Slitherlink [12], Juosan [14], Numberlink [23], Suguru [20], Ripple Effect [24], Nurikabe [19], Hitori [19], Cryptarithmetic [8], and Bridges [25]. All of these protocols, however, either require special tools or use a deck with repeated cards.…”
Section: Other Protocolsmentioning
confidence: 99%
“…Note that in this surveillance model where players watch that the protocol is done correctly, many protocols can be argued secure with almost no interaction. For example, ( [21], Protocol 3) is a nice physical zero-knowledge proof system for proving that there is a solution to a Sudoku puzzle, where the verifier chooses one of three cards in each cells of the Sudoku to be assigned to piles for rows, columns and subgrids to be able to later verify that all numbers are present. In our model, we can plausibly argue that the randomness chosen by the verifier can also be directly generated by the prover himself on an additional deck of helping cards.…”
Section: Introductionmentioning
confidence: 99%