Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku

06/25/2021
by   Suthee Ruangwises, et al.
0

Sudoku is a logic puzzle with an objective to fill a number between 1 and 9 in each empty cell of a 9 × 9 grid such that every number appears exactly once in each row, each column, and each 3 × 3 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 n × n Sudoku that can be performed using a deck of all different cards.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2021

Physical ZKP for Makaro Using a Standard Deck of Cards

Makaro is a logic puzzle with an objective to fill numbers into a rectan...
research
06/26/2021

An Improved Physical ZKP for Nonogram

Nonogram is a logic puzzle consisting of a rectangular grid with an obje...
research
09/21/2020

Physical Zero-Knowledge Proof for Ripple Effect

Ripple Effect is a logic puzzle with an objective to fill numbers into a...
research
02/20/2022

How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku

Shikaku is a pencil puzzle consisting of a rectangular grid, with some c...
research
02/02/2023

Physical Zero-Knowledge Proof for Five Cells

Five Cells is a pencil puzzle consisting of a rectangular grid, with som...
research
04/24/2023

Physically Verifying the First Nonzero Term in a Sequence: Physical ZKPs for ABC End View and Goishi Hiroi

In this paper, we develop a physical protocol to verify the first nonzer...
research
11/03/2020

Physical Zero-Knowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle

An undirected graph G is known to both the prover P and the verifier V, ...

Please sign up or login with your details

Forgot password? Click here to reset