TY - GEN
T1 - A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards
AU - Koyama, Hiroto
AU - Miyahara, Daiki
AU - Mizuki, Takaaki
AU - Sone, Hideaki
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Card-based protocols are used to perform cryptographic tasks such as secure multiparty computation using a deck of physical cards. While most of the existing protocols use a two-colored deck consisting of red cards and black cards, Niemi and Renvall in 1999 constructed protocols for securely computing two-input Boolean functions (such as secure logical AND and XOR computations) using a commonly available standard deck of playing cards. Since this initial investigation, two-input protocols with fewer cards and/or shuffles have been designed, and by combining them, one can perform a secure computation of any Boolean circuit. In this paper, we directly construct a simple card-based protocol for the three-input AND computation. Our three-input AND protocol requires fewer cards and shuffles compared to that required when applying any existing two-input AND protocol twice to perform the three-input AND computation. Our protocol is unique in the sense that it is card minimal if we use two cards to encode a single bit.
AB - Card-based protocols are used to perform cryptographic tasks such as secure multiparty computation using a deck of physical cards. While most of the existing protocols use a two-colored deck consisting of red cards and black cards, Niemi and Renvall in 1999 constructed protocols for securely computing two-input Boolean functions (such as secure logical AND and XOR computations) using a commonly available standard deck of playing cards. Since this initial investigation, two-input protocols with fewer cards and/or shuffles have been designed, and by combining them, one can perform a secure computation of any Boolean circuit. In this paper, we directly construct a simple card-based protocol for the three-input AND computation. Our three-input AND protocol requires fewer cards and shuffles compared to that required when applying any existing two-input AND protocol twice to perform the three-input AND computation. Our protocol is unique in the sense that it is card minimal if we use two cards to encode a single bit.
KW - Card-based cryptography
KW - Logical AND function
KW - Real-life hands-on cryptography
KW - Secure computation
UR - http://www.scopus.com/inward/record.url?scp=85110032667&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85110032667&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-79416-3_14
DO - 10.1007/978-3-030-79416-3_14
M3 - Conference contribution
AN - SCOPUS:85110032667
SN - 9783030794156
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 242
EP - 256
BT - Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings
A2 - Santhanam, Rahul
A2 - Musatov, Daniil
PB - Springer Science and Business Media Deutschland GmbH
T2 - 16th International Computer Science Symposium in Russia, CSR 2021
Y2 - 28 June 2021 through 2 July 2021
ER -