activity
20142026
most citedPhysical Zero-Knowledge Proof for Numberlink Puzzle and Vertex-Disjoint Paths Problem

51 citations · 330 across the 30 of their papers we have counts for

collaborators
Showing cs.CRShow all

19 papers · 1 filter

cs.CR2026

Card-Based Computation in the Virtual Player Simulation Model

Suthee Ruangwises

Player simulation has recently emerged as a new direction in card-based cryptography, with protocols developed for simulating virtual players in physical card games such as Old Mai…

cs.CR2026

A Complexity Hierarchy of Shuffles in Card-Based Protocols

Tomoki Ono, Suthee Ruangwises

Card-based cryptography uses physical playing cards to construct protocols for secure multi-party computation. Existing card-based protocols employ various types of shuffles, some…

cs.CR2025★ 3 cited

Simulating Virtual Players for UNO without Computers

Suthee Ruangwises, Kazumasa Shinagawa

UNO is a popular multiplayer card game. In each turn, a player has to play a card in their hand having the same number or color as the most recently played card. When having few pe…

cs.CR2025★ 1 cited

Balance-Based Cryptography: Physically Computing Any Boolean Function

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,…

cs.CR2024

Tatami Printer: Physical ZKPs for Tatami Puzzles

Suthee Ruangwises

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 o…

cs.CR2024★ 3 cited

Card-Based Overwriting Protocol for Equality Function and Applications

Suthee Ruangwises, Tomoki Ono, Yoshiki Abe +2

Research in the area of secure multi-party computation with an unconventional method of using a physical deck of playing cards began in 1989 when den Boer proposed a protocol to co…

cs.CR2023★ 5 cited

The Landscape of Computing Symmetric -Variable Functions with Cards

Suthee Ruangwises

Secure multi-party computation using a physical deck of cards, often called card-based cryptography, has been extensively studied during the past decade. Card-based protocols to co…

cs.CR2023★ 5 cited

Verifying the First Nonzero Term: Physical ZKPs for ABC End View, Goishi Hiroi, and Toichika

Suthee Ruangwises

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 t…

cs.CR2023★ 15 cited

Physical Zero-Knowledge Proof for Ball Sort Puzzle

Suthee Ruangwises

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 o…

cs.CR2023★ 7 cited

Printing Protocol: Physical ZKPs for Decomposition Puzzles

Suthee Ruangwises, Mitsugu Iwamoto

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 g…

cs.CR2022★ 4 cited

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

Suthee Ruangwises, Toshiya Itoh

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 cont…

cs.CR2021★ 24 cited

Physical ZKP for Makaro Using a Standard Deck of Cards

Suthee Ruangwises, Toshiya Itoh

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 (…

cs.CR2021★ 38 cited

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

Suthee Ruangwises

Sudoku is a famous logic puzzle where the player has to fill a number between 1 and 9 into each empty cell of a grid such that every number appears exactly once in eac…

cs.CR2020★ 8 cited

Using Five Cards to Encode Each Integer in

Suthee Ruangwises

Research in secure multi-party computation using a deck of playing cards, often called card-based cryptography, dates back to 1989 when Den Boer introduced the "five-card trick" to…

cs.CR2020★ 37 cited

Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems

Suthee Ruangwises, Toshiya Itoh

An undirected graph is known to both the prover and the verifier , but only knows a subgraph of . Without revealing any information about , wants to co…

cs.CR2020★ 33 cited

Physical Zero-Knowledge Proof for Ripple Effect

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…

cs.CR2020★ 51 cited

Physical Zero-Knowledge Proof for Numberlink Puzzle and Vertex-Disjoint Paths Problem

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…

cs.CR2019★ 42 cited

Securely Computing the -Variable Equality Function with Cards

Suthee Ruangwises, Toshiya Itoh

Research in the area of secure multi-party computation using a deck of playing cards, often called card-based cryptography, started from the introduction of the five-card trick pro…

cs.CR2018★ 27 cited

AND Protocols Using Only Uniform Shuffles

Suthee Ruangwises, Toshiya Itoh

Secure multi-party computation using a deck of playing cards has been a subject of research since the "five-card trick" introduced by den Boer in 1989. One of the main problems in…