Card-based zero-knowledge proof protocols for the 15-puzzle and the token swapping problem
Y Tamura, A Suzuki, T Mizuki - Proceedings of the 11th ACM Asia Public …, 2024 - dl.acm.org
The 15-puzzle is a puzzle game played with 15 square tiles numbered from 1 to 15 on a 4×
4 board. It has been popular for generations because of its simplicity and challenge. The (w× …
4 board. It has been popular for generations because of its simplicity and challenge. The (w× …
Physical Zero-Knowledge Proof Protocols for Topswops and Botdrops
Suppose that a sequence of n cards, numbered 1 to n, is placed face up in random order.
Let k be the number on the first card in the sequence. Then take the first k cards from the …
Let k be the number on the first card in the sequence. Then take the first k cards from the …
Efficient Card-Based ZKP for Single Loop Condition and Its Application to Moon-or-Sun
A zero-knowledge proof (ZKP) allows a prover to prove to a verifier that it knows some
secret, such as a solution to a difficult puzzle, without revealing any information about it. In …
secret, such as a solution to a difficult puzzle, without revealing any information about it. In …
Upper bounds on the number of shuffles for two-helping-card multi-input and protocols
T Yoshida, K Tanaka, K Nakabayashi, E Chida… - … on Cryptology and …, 2023 - Springer
Card-based cryptography uses a physical deck of cards to achieve secure computations. To
evaluate the performance of card-based protocols, the numbers of helping cards and …
evaluate the performance of card-based protocols, the numbers of helping cards and …
Balance-Based ZKP Protocols for Pencil-and-Paper Puzzles
S Kaneko, P Lafourcade, LB Mallordy… - … on Information Security, 2024 - Springer
In this paper, we propose zero-knowledge proof (ZKP) protocols using physical objects for
four pencil-and-paper puzzles: the well-known Sudoku as well as Makaro, Futoshiki, and …
four pencil-and-paper puzzles: the well-known Sudoku as well as Makaro, Futoshiki, and …
Printing Protocol: Physical ZKPs for Decomposition Puzzles
S Ruangwises, M Iwamoto - New Generation Computing, 2024 - Springer
Decomposition puzzles are pencil-and-paper logic puzzles that involve partitioning a
rectangular grid into several regions to satisfy certain rules. In this paper, we construct a …
rectangular grid into several regions to satisfy certain rules. In this paper, we construct a …
Verifying the first nonzero term: physical ZKPs for ABC End View, Goishi Hiroi, and Toichika
S Ruangwises - Journal of Combinatorial Optimization, 2024 - Springer
In this paper, we propose a physical protocol to verify the first nonzero term of a sequence
using a deck of cards. The protocol lets a prover show the value of the first nonzero term of a …
using a deck of cards. The protocol lets a prover show the value of the first nonzero term of a …