Simulating virtual players for UNO without computers

DOI10.1007/978-3-032-15641-9_3MaRDI QIDQ7348919zbMATH OpenFDO

Authors Suthee Ruangwises, Kazumasa Shinagawa

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_3

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A single shuffle is enough for secure card-based computation of any Boolean circuit
• An improved physical ZKP for nonogram and nonogram color
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• Card-based protocols for any Boolean function
• Card-based protocols for securely computing the conjunction of multiple variables
• Card-based zero-knowledge proof protocols for graph problems and their computational model
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• Efficient card-based zero-knowledge proof for Sudoku
• How to play Old Maid with virtual players
• Only two shuffles perform card-based zero-knowledge proof for Sudoku of any size
• Physical zero-knowledge proof for ball sort puzzle
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Six-Card Secure AND and Four-Card Secure XOR
• The Knowledge Complexity of Interactive Proof Systems
• Theory and practice of natural computing. Second international conference, TPNC 2013, Cáceres, Spain, December 3--5, 2013. Proceedings

This page was built for publication: Simulating virtual players for UNO without computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348919)