TY - GEN
T1 - Five-card secure computations using unequal division shuffle
AU - Nishimura, Akihiro
AU - Nishida, Takuya
AU - Hayashi, Yu ichi
AU - Mizuki, Takaaki
AU - Sone, Hideaki
N1 - Funding Information:
This work was supported by JSPS KAKENHI Grant Numbers 25289068 and 26330001.
Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - Card-based cryptographic protocols can perform secure computation of Boolean functions. Cheung et al. recently presented an elegant protocol that securely produces a hidden AND value using five cards; however, it fails with a probability of 1/2. The protocol uses an unconventional shuffle operation called unequal division shuffle; after a sequence of five cards is divided into a two-card portion and a threecard portion, these two portions are randomly switched. In this paper, we first show that the protocol proposed by Cheung et al. securely produces not only a hidden AND value but also a hidden OR value (with a probability of 1/2). We then modify their protocol such that, even when it fails, we can still evaluate the AND value. Furthermore, we present two five-card copy protocols using unequal division shuffle. Because the most efficient copy protocol currently known requires six cards, our new protocols improve upon the existing results.
AB - Card-based cryptographic protocols can perform secure computation of Boolean functions. Cheung et al. recently presented an elegant protocol that securely produces a hidden AND value using five cards; however, it fails with a probability of 1/2. The protocol uses an unconventional shuffle operation called unequal division shuffle; after a sequence of five cards is divided into a two-card portion and a threecard portion, these two portions are randomly switched. In this paper, we first show that the protocol proposed by Cheung et al. securely produces not only a hidden AND value but also a hidden OR value (with a probability of 1/2). We then modify their protocol such that, even when it fails, we can still evaluate the AND value. Furthermore, we present two five-card copy protocols using unequal division shuffle. Because the most efficient copy protocol currently known requires six cards, our new protocols improve upon the existing results.
KW - Card games
KW - Card-based protocols
KW - Cryptography
KW - Cryptography without computers
KW - Real-life hands-on cryptography
KW - Secure multi-party computations
UR - http://www.scopus.com/inward/record.url?scp=84951871481&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84951871481&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-26841-5_9
DO - 10.1007/978-3-319-26841-5_9
M3 - Conference contribution
AN - SCOPUS:84951871481
SN - 9783319268408
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 109
EP - 120
BT - Theory and Practice of Natural Computing - 4th International Conference, TPNC 2015, Proceedings
A2 - Dediu, Adrian-Horia
A2 - Martín-Vide, Carlos
A2 - Magdalena, Luis
PB - Springer Verlag
T2 - 4th International Conference on Theory and Practice of Natural Computing, TPNC 2015
Y2 - 15 December 2015 through 16 December 2015
ER -