[HTML][HTML] Efficient card-based zero-knowledge proof for Sudoku
Abstract 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 …
proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols …
Two standard decks of playing cards are sufficient for a ZKP for Sudoku
S Ruangwises - New Generation Computing, 2022 - Springer
Sudoku is a famous logic puzzle where the player has to fill a number between 1 and 9 into
each empty cell of a 9× 9 grid such that every number appears exactly once in each row …
each empty cell of a 9× 9 grid such that every number appears exactly once in each row …
How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition
We propose a technique to construct physical Zero-Knowledge Proof (ZKP) protocols for
puzzles that require a single loop draw feature. Our approach is based on the observation …
puzzles that require a single loop draw feature. Our approach is based on the observation …
Card-based ZKP for connectivity: applications to Nurikabe, Hitori, and Heyawake
During the last years, several card-based Zero-Knowledge Proof (ZKP) protocols for Nikoli's
puzzles have been designed. Although there are relatively simple card-based ZKP protocols …
puzzles have been designed. Although there are relatively simple card-based ZKP protocols …
Physical zero-knowledge proof for ripple effect
S Ruangwises, T Itoh - Theoretical Computer Science, 2021 - Elsevier
Ripple Effect is a logic puzzle where the player has to fill numbers into empty cells in a
rectangular grid. The grid is divided into rooms, and each room must contain consecutive …
rectangular grid. The grid is divided into rooms, and each room must contain consecutive …
Card-based ZKP protocols for Takuzu and Juosan
Takuzu and Juosan are logical Nikoli games in the spirit of Sudoku. In Takuzu, a grid must
be filled with 0's and 1's under specific constraints. In Juosan, the grid must be filled with …
be filled with 0's and 1's under specific constraints. In Juosan, the grid must be filled with …
Physical Zero-Knowledge Proof for Numberlink Puzzle and k Vertex-Disjoint Paths Problem
S Ruangwises, T Itoh - New Generation Computing, 2021 - Springer
Numberlink is a logic puzzle with an objective to connect all pairs of cells with the same
number by non-crossing paths in a rectangular grid. In this paper, we propose a physical …
number by non-crossing paths in a rectangular grid. In this paper, we propose a physical …
Physical zero-knowledge proof for Makaro
Makaro is a logic game similar to Sudoku. In Makaro, a grid has to be filled with numbers
such that: given areas contain all the numbers up to the number of cells in the area, no …
such that: given areas contain all the numbers up to the number of cells in the area, no …
Interactive physical zero-knowledge proof for Norinori
Norinori is a logic game similar to Sudoku. In Norinori, a grid of cells has to be filled with
either black or white cells so that the given areas contain exactly two black cells, and every …
either black or white cells so that the given areas contain exactly two black cells, and every …
Card-based physical zero-knowledge proof for Kakuro
Kakuro is a popular logic puzzle, in which a player fills in all empty squares with digits from 1
to 9 so that the sum of digits in each (horizontal or vertical) line is equal to a given number …
to 9 so that the sum of digits in each (horizontal or vertical) line is equal to a given number …