Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Gakmoro: An Application of Physical Secure Computation to Card Game

Takaaki Mizuki, Tomoki Kuzuma, Tomoya Hirano, Ririn Oshima, Momofuku Yasuda

Published Jan 1, 2026• 6 citations
Publisher
DOI
10.1007/978-3-032-15641-9_23

Related papers

Card-Based Secure Ranking Computations

Ken Takashima, Yuta Abe, Tatsuya Sasaki +4 more

Lecture notes in computer science•Jan 1, 2019•9 citations

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 Maid, UNO, and President. Unlike conventional card-based secure computation, player simulation imposes additional constraints: the cards represent a persistent game state, the remaining cards in a virtual player's hand must be preserved after each action, and it is desirable to represent each card in the game by a single physical card. In this paper, we study generic card-based computation in the virtual player simulation model. We focus on games whose cards admit a publicly known ranking and propose two fundamental protocols. First, we present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand when all cards in the deck have distinct values. By symmetry, the protocol can also be used to play the maximum-value card. Second, we present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order and remains applicable when multiple cards have the same value. These protocols provide generic computational primitives independent of any particular card game and constitute a step toward understanding the computational capabilities of the virtual player simulation model.

arXiv:2609.02716•Sep 2, 2026•0 citations

Secure Card-Based Cryptographic Protocols Using Private Operations Against Malicious Players

Yoshifumi Manabe, Hibiki Ono

Lecture notes in computer science•Jan 1, 2021•13 citations

Efficient Electronic Gambling: An Extended Implementation of the Toolbox for Mental Card Games.

Heiko Stamer

Abstract: There are many wonderful protocols in cryptography which are still waiting for their realization. Here we consider efficient solutions for secure electronic card games. Our contribution seems to be the first known practical implementation that requires no trusted third-party and simultaneously keeps the players ’ strategies confidential. The provided open source library LibTMCG can be used for creating secure peer-to-peer games and furthermore for some unusual applications, e.g., secure multiparty computation or simple electronic voting schemes.

•Jan 1, 2005•5 citations

Computational Model of Card-Based Cryptographic Protocols and Its Applications

Takaaki Mizuki, Hiroki Shizuya

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Dec 31, 2016•65 citations

Practical Card-Based Cryptography

Takaaki Mizuki, Hiroki Shizuya

Lecture notes in computer science•Jan 1, 2014•51 citations
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 Maid, UNO, and President. Unlike conventional card-based secure computation, player simulation imposes additional constraints: the cards represent a persistent game state, the remaining cards in a virtual player's hand must be preserved after each action, and it is desirable to represent each card in the game by a single physical card. In this paper, we study generic card-based computation in the virtual player simulation model. We focus on games whose cards admit a publicly known ranking and propose two fundamental protocols. First, we present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand when all cards in the deck have distinct values. By symmetry, the protocol can also be used to play the maximum-value card. Second, we present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order and remains applicable when multiple cards have the same value. These protocols provide generic computational primitives independent of any particular card game and constitute a step toward understanding the computational capabilities of the virtual player simulation model.
Abstract: There are many wonderful protocols in cryptography which are still waiting for their realization. Here we consider efficient solutions for secure electronic card games. Our contribution seems to be the first known practical implementation that requires no trusted third-party and simultaneously keeps the players ’ strategies confidential. The provided open source library LibTMCG can be used for creating secure peer-to-peer games and furthermore for some unusual applications, e.g., secure multiparty computation or simple electronic voting schemes.