TY - GEN
T1 - Card-Based Covert Lottery
AU - Shinoda, Yuto
AU - Miyahara, Daiki
AU - Shinagawa, Kazumasa
AU - Mizuki, Takaaki
AU - Sone, Hideaki
N1 - Funding Information:
Acknowledgements. We thank the anonymous referees, whose comments have helped us to improve the presentation of the paper. We thank the anonymous reviewer at some conference who have inspired us to present the protocol shown in Sect. 3. This work was supported in part by JSPS KAKENHI Grant Numbers JP19J21153 and JP20J01192.
Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Before starting to play a two-player board game such as Chess and Shogi (namely, Japanese chess), we have to determine who makes the first move. Players’ strategies of Chess and Shogi often rely on whether they will move first or not, and most players have their own preferences. Therefore, it would be nice if we can take their individual requests into account when determining who goes first. To this end, if the two players simply tell their preferable moves to each other, they will notice the other’s strategy. Thus, we want the players to determine the first move according to their requests while hiding any information about them. Note that this problem cannot be solved by a typical way done in Chess, namely, a coin-flipping. In this paper, we formalize this problem in a cryptographic perspective and propose a secure protocol that solves this problem using a deck of physical cards. Moreover, we extend this problem to the multi-player setting: Assume that there is a single prize in a lottery drawing among more than two players, each of who has an individual secret feeling ‘Yes’ or ‘No’ that indicates whether he/she really wants to get the prize or not. If one or more players have ‘Yes,’ we want to randomly and covertly choose a winner among those having ‘Yes.’ If all of them have ‘No,’ we want to randomly pick a winner among all the players. We solve this extended problem, which we call the “covert lottery” problem, by proposing a simple card-based protocol.
AB - Before starting to play a two-player board game such as Chess and Shogi (namely, Japanese chess), we have to determine who makes the first move. Players’ strategies of Chess and Shogi often rely on whether they will move first or not, and most players have their own preferences. Therefore, it would be nice if we can take their individual requests into account when determining who goes first. To this end, if the two players simply tell their preferable moves to each other, they will notice the other’s strategy. Thus, we want the players to determine the first move according to their requests while hiding any information about them. Note that this problem cannot be solved by a typical way done in Chess, namely, a coin-flipping. In this paper, we formalize this problem in a cryptographic perspective and propose a secure protocol that solves this problem using a deck of physical cards. Moreover, we extend this problem to the multi-player setting: Assume that there is a single prize in a lottery drawing among more than two players, each of who has an individual secret feeling ‘Yes’ or ‘No’ that indicates whether he/she really wants to get the prize or not. If one or more players have ‘Yes,’ we want to randomly and covertly choose a winner among those having ‘Yes.’ If all of them have ‘No,’ we want to randomly pick a winner among all the players. We solve this extended problem, which we call the “covert lottery” problem, by proposing a simple card-based protocol.
KW - Card-based protocols
KW - Deck of cards
KW - Physical cryptography
KW - Real-life hands-on cryptography
KW - Secure multiparty computations
UR - http://www.scopus.com/inward/record.url?scp=85101511882&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85101511882&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-69255-1_17
DO - 10.1007/978-3-030-69255-1_17
M3 - Conference contribution
AN - SCOPUS:85101511882
SN - 9783030692544
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 257
EP - 270
BT - Innovative Security Solutions for Information Technology and Communications - 13th International Conference, SecITC 2020, Revised Selected Papers
A2 - Maimut, Diana
A2 - Oprina, Andrei-George
A2 - Sauveron, Damien
PB - Springer Science and Business Media Deutschland GmbH
T2 - 13th International Conference on Security for Information Technology and Communications, SecITC 2020
Y2 - 19 November 2020 through 20 November 2020
ER -