9 research outputs found
Card-Based Zero-Knowledge Proof for Sudoku
In 2009, Gradwohl, Naor, Pinkas, and Rothblum proposed physical zero-knowledge proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols allow a prover to convince a verifier that there is a solution to the Sudoku puzzle and that he/she knows it, without revealing any information about the solution. The possible drawback is that the existing protocols have a soundness error with a non-zero probability or need special cards (such as scratch-off cards). Thus, in this study, we propose new protocols to perform zero-knowledge proof for Sudoku that use a normal deck of playing cards and have no soundness error. Our protocols can be easily implemented by humans with a reasonable number of playing cards
An Improved Physical ZKP for Nonogram
Nonogram is a logic puzzle consisting of a rectangular grid with an objective
to color every cell black or white such that the lengths of blocks of
consecutive black cells in each row and column are equal to the given numbers.
In 2010, Chien and Hon developed the first physical zero-knowledge proof for
Nonogram, which allows a prover to physically show that he/she knows a solution
of the puzzle without revealing it. However, their protocol requires special
tools such as scratch-off cards and a machine to seal the cards, which are
difficult to find in everyday life. Their protocol also has a nonzero soundness
error. In this paper, we propose a more practical physical zero-knowledge proof
for Nonogram that uses only a deck of regular paper cards and also has perfect
soundness.Comment: This paper has appeared at COCOA 202
Physical Zero-Knowledge Proof for Numberlink
Numberlink is a logic puzzle for which the player has to connect all pairs of cells with the same numbers by non-crossing paths in a rectangular grid. In this paper, we propose a physical protocol of zero-knowledge proof for Numberlink using a deck of cards, which allows a player to physically show that he/she knows a solution without revealing it. In particular, we develop a physical protocol to count the number of elements in a list that are equal to a given secret value without revealing that value, the positions of elements in the list that are equal to it, or the value of any other element in the list. Our protocol can also be applied to verify the existence of vertex-disjoint paths connecting all given pairs of endpoints in any undirected graph
Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku
Sudoku is a logic puzzle with an objective to fill a number between 1 and 9
in each empty cell of a grid such that every number appears
exactly once in each row, each column, and each block. In 2020,
Sasaki et al. proposed a physical zero-knowledge proof (ZKP) protocol for
Sudoku using 90 cards, which allows a prover to physically show that he/she
knows a solution without revealing it. However, their protocol requires nine
identical copies of some cards, which cannot be found in a standard deck of
playing cards. Therefore, nine decks of cards are actually required in order to
perform that protocol. In this paper, we propose a new ZKP protocol for Sudoku
that can be performed using only two standard decks of playing cards. In
general, we develop the first ZKP protocol for an Sudoku that can
be performed using a deck of all different cards.Comment: A shortened version of this paper has appeared at COCOON 202
Private Function Evaluation with Cards
Card-based protocols allow to evaluate an arbitrary fixed Boolean function on a hidden input to obtain a hidden output, without the executer learning anything about either of the two (e.g., [12]). We explore the case where implements a universal function, i.e., is given the encoding ⟨⟩ of a program and an input and computes (⟨⟩,)=(). More concretely, we consider universal circuits, Turing machines, RAM machines, and branching programs, giving secure and conceptually simple card-based protocols in each case. We argue that card-based cryptography can be performed in a setting that is only very weakly interactive, which we call the “surveillance” model. Here, when Alice executes a protocol on the cards, the only task of Bob is to watch that Alice does not illegitimately turn over cards and that she shuffles in a way that nobody knows anything about the total permutation applied to the cards. We believe that because of this very limited interaction, our results can be called program obfuscation. As a tool, we develop a useful sub-protocol ↑ that couples the two equal-length sequences , and jointly and obliviously permutes them with the permutation ∈ that lexicographically minimizes (). We argue that this generalizes ideas present in many existing card-based protocols. In fact, AND, XOR, bit copy [37], coupled rotation shuffles [30] and the “permutation division” protocol of [22] can all be expressed as “coupled sort protocols”