3 citations · 4 across the 5 of their papers we have counts for
9 papers
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…
Cyclic Equalizability Characterized by Parikh Vectors
Sarunyu Thongjarast, Sarit Pasiphol, Suthee Ruangwises
Cyclic equalizability is a notion introduced by Shinagawa and Nuida in 2025, in the study of card-based cryptography. Informally, a collection of words is cyclically equalizable if…
Wataridori is NP-Complete
Suthee Ruangwises
Wataridori is a pencil puzzle that involves drawing paths in a rectangular grid to connect circles into pairs while satisfying several constraints. In this paper, we prove that dec…
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…
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,…
NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework
Pakapim Eua-anant, Papangkorn Apinyanon, Thunyatorn Jirachaisri +2
All or Nothing, Water Walk, and Remembered Length are pencil puzzles that involve constructing a continuous loop on a rectangular grid under specific constraints. In this paper, we…