English
Related papers

Related papers: Physical Zero-Knowledge Proof for Ripple Effect

200 papers

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

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

Ball sort puzzle is a popular logic puzzle consisting of several bins containing balls of multiple colors. Each bin works like a stack; a ball has to follow the last-in first-out order. The player has to sort the balls by color such that…

Cryptography and Security · Computer Science 2023-12-04 Suthee Ruangwises

We consider the following card guessing game with no feedback. An ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards. One after…

Combinatorics · Mathematics 2023-08-31 Markus Kuba , Alois Panholzer

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

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

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

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

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

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

We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is riffle-shuffled exactly one time. Given a value $p\in(0{,}1)\setminus\{\frac12\}$, the riffle shuffle is assumed to be…

Combinatorics · Mathematics 2026-02-13 Markus Kuba

When shuffling a deck of cards, one probably wants to make sure it is thoroughly shuffled. A way to do this is by sifting through the cards to ensure that no adjacent cards are the same number, because surely this is a poorly shuffled deck.…

Combinatorics · Mathematics 2019-11-19 James Enouen

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

We consider a card guessing game with complete feedback. A ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards, where one after…

Combinatorics · Mathematics 2023-08-31 Markus Kuba , Alois Panholzer

This paper studies the game of guessing riffle-shuffled cards with complete feedback. A deck of $n$ cards labelled 1 to $n$ is riffle-shuffled once and placed on a table. A player tries to guess the cards from top and is given complete…

Probability · Mathematics 2021-07-20 Pengda Liu

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

Consider n cards that are labeled 1 through n with n an even integer. The cards are put face down and their ordering starts with card labeled 1 on top through card labeled n at the bottom. The cards are top to random shuffled m times and…

Probability · Mathematics 2010-06-08 Lerna Pehlivan

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

Bridge is a trick-taking card game requiring the ability to evaluate probabilities since it is a game of incomplete information where each player only sees its cards. In order to choose a strategy, a player needs to gather information about…

Artificial Intelligence · Computer Science 2020-01-23 J Li , S Thepaut , V Ventos

Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one…

‹ Prev 1 2 3 10 Next ›