English
Related papers

Related papers: Physical Zero-Knowledge Proof for Ball Sort Puzzle

200 papers

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 protocol of zero-knowledge proof for Numberlink using a deck…

Cryptography and Security · Computer Science 2021-06-01 Suthee Ruangwises , Toshiya Itoh

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 integers starting from 1 to its size. Also, if two cells in…

Cryptography and Security · Computer Science 2021-11-11 Suthee Ruangwises , Toshiya Itoh

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 generic card-based protocol called printing protocol, which…

Cryptography and Security · Computer Science 2024-09-17 Suthee Ruangwises , Mitsugu Iwamoto

Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled with colored units, balls or water, and some empty bins.…

Shikaku is a pencil puzzle consisting of a rectangular grid, with some cells containing a number. The player has to partition the grid into rectangles such that each rectangle contains exactly one number equal to the area of that rectangle.…

Cryptography and Security · Computer Science 2022-10-26 Suthee Ruangwises , Toshiya Itoh

In this paper we describe protocols which use a standard deck of cards to provide a perfectly sound zero-knowledge proof for Hamiltonian cycles and Flow Free puzzles. The latter can easily be extended to provide a protocol for a…

Cryptography and Security · Computer Science 2022-02-10 Eammon Hart , Joshua A. McGinnis

Nonogram is a pencil puzzle consisting of a rectangular white grid where the player has to paint some cells black according to given constraints. In 2010, Chien and Hon constructed a physical card-based zero-knowledge proof protocol for…

Computational Complexity · Computer Science 2023-07-20 Suthee Ruangwises

Makaro is a logic puzzle with an objective to fill numbers into a rectangular grid to satisfy certain conditions. In 2018, Bultel et al. developed a physical zero-knowledge proof (ZKP) protocol for Makaro using a deck of cards, which allows…

Cryptography and Security · Computer Science 2023-01-03 Suthee Ruangwises , Toshiya Itoh

Hotaru Beam is a logic puzzle which objective is to connect circles placed on a grid by drawing only lines with specified starting points and numbers of bends. A zero-knowledge proof is a communication protocol that allows one player to…

Computational Complexity · Computer Science 2026-03-03 Taisei Otsuji , Peter Fulla , Takuro Fukunaga

An undirected graph $G$ is known to both the prover $P$ and the verifier $V$, but only $P$ knows a subgraph $H$ of $G$. Without revealing any information about $H$, $P$ wants to convince $V$ that $H$ is a connected spanning subgraph of $G$,…

Cryptography and Security · Computer Science 2021-10-14 Suthee Ruangwises , Toshiya Itoh

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 \times 9$ grid such that every number appears exactly once in each row, each column, and each $3 \times 3$ block. In 2020,…

Cryptography and Security · Computer Science 2022-05-19 Suthee Ruangwises

Akari, Takuzu, Kakuro and KenKen are logic games similar to Sudoku. In Akari, a labyrinth on a grid has to be lit by placing lanterns, respecting various constraints. In Takuzu a grid has to be filled with 0's and 1's, while respecting…

Cryptography and Security · Computer Science 2016-06-06 Xavier Bultel , Jannik Dreier , Jean-Guillaume Dumas , Pascal Lafourcade

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 given sequence to a verifier without revealing…

Cryptography and Security · Computer Science 2024-08-19 Suthee Ruangwises

The move-minimizing puzzles presented here are certain types of one-player combinatorial games that are shown to have explicit solutions whenever they can be encoded in a certain way as diamond-colored modular or distributive lattices. Our…

Combinatorics · Mathematics 2023-12-05 Robert G. Donnelly , Elizabeth A. Donovan , Molly W. Dunkum , Timothy A. Schroeder

Zeiger is a pencil puzzle consisting of a rectangular grid, with each cell having an arrow pointing in horizontal or vertical direction. Some cells also contain a positive integer. The objective of this puzzle is to fill a positive integer…

Computational Complexity · Computer Science 2025-03-04 Suthee Ruangwises

Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols, many unconventional protocols for secure multi-party…

Cryptography and Security · Computer Science 2026-03-18 Suthee Ruangwises

Zero-knowledge proofs are mathematical cryptographic methods to demonstrate the validity of a claim while providing no further information beyond the claim itself. The possibility of using such proofs to process classified and other…

Instrumentation and Detectors · Physics 2016-12-02 Sébastien Philippe , Robert J. Goldston , Alexander Glaser , Francesco d'Errico

Protecting secrets is a key challenge in our contemporary information-based era. In common situations, however, revealing secrets appears unavoidable, for instance, when identifying oneself in a bank to retrieve money. In turn, this may…

Cryptography and Security · Computer Science 2022-02-17 Pouriya Alikhani , Nicolas Brunner , Claude Crépeau , Sébastien Designolle , Raphaël Houlmann , Weixu Shi , Nan Yang , Hugo Zbinden

Tatami puzzles are pencil puzzles with an objective to partition a rectangular grid into rectangular regions such that no four regions share a corner point, as well as satisfying other constraints. In this paper, we develop a physical…

Cryptography and Security · Computer Science 2025-06-10 Suthee Ruangwises

We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…

Discrete Mathematics · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Helena A. Verrill
‹ Prev 1 2 3 10 Next ›