TY - JOUR
T1 - How to Play Old Maid with Virtual Players
AU - Shinagawa, Kazumasa
AU - Miyahara, Daiki
AU - Mizuki, Takaaki
N1 - Publisher Copyright:
© The Author(s) 2025.
PY - 2025/3
Y1 - 2025/3
N2 - Old Maid is a popular card game. While typically played with three or more players, it is less enjoyable with only two people. To address this, we propose a protocol to create a virtual player, Carol, by making use of card-based cryptography when only two people, Alice and Bob, are available to play Old Maid. Specifically, we design a card-based protocol to remove any pair of cards having the same number in Carol’s hand (namely, the virtual player’s hand) without leaking any information about Carol’s hand (more than necessary); our protocol uses additional cards aside from playing cards that are used in Old Maid.
AB - Old Maid is a popular card game. While typically played with three or more players, it is less enjoyable with only two people. To address this, we propose a protocol to create a virtual player, Carol, by making use of card-based cryptography when only two people, Alice and Bob, are available to play Old Maid. Specifically, we design a card-based protocol to remove any pair of cards having the same number in Carol’s hand (namely, the virtual player’s hand) without leaking any information about Carol’s hand (more than necessary); our protocol uses additional cards aside from playing cards that are used in Old Maid.
KW - Card games
KW - Card-based cryptography
KW - Cryptology
KW - Old maid
UR - http://www.scopus.com/inward/record.url?scp=85219595664&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85219595664&partnerID=8YFLogxK
U2 - 10.1007/s00224-024-10203-w
DO - 10.1007/s00224-024-10203-w
M3 - Article
AN - SCOPUS:85219595664
SN - 1432-4350
VL - 69
JO - Theory of Computing Systems
JF - Theory of Computing Systems
IS - 1
M1 - 13
ER -