TY - GEN
T1 - Five-card and protocol in committed format using only practical shuffles
AU - Abe, Yuta
AU - Mizuki, Takaaki
AU - Hayashi, Yu-Ichi
AU - Sone, Hideaki
N1 - Publisher Copyright:
© 2018 Copyright held by the owner/author(s).
PY - 2018/5/23
Y1 - 2018/5/23
N2 - In card-based cryptography, designing AND protocols in committed format is a major topic of research. The state-of-the-art AND protocol proposed by Koch,Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number. Their protocol's minimality relies on somewhat complicated shuffles having non-uniform probabilities of possible outcomes. Restricting the allowed shuffles to "practical" ones, namely uniform closed shuffles, to our knowledge, six cards are sufficient: The sixcard AND protocol proposed by Mizuki and Sone in 2009 utilizes the random bisection cut, which is a uniform and cyclic (and hence, closed) shuffle. Thus, a question has arisen: Can we improve upon this six-card protocol using only practical shuffles? In other words, whether there exists a five-card AND protocol in committed format using only uniform closed shuffles has been one of the most important open questions in this field. In this paper, we answer the question affirmatively by designing a five-card committed-format AND protocol using only practical shuffles. The shuffles that our protocol uses are random cut and random bisection cut, both of which are uniform cyclic shuffles and can be easily implemented by humans.
AB - In card-based cryptography, designing AND protocols in committed format is a major topic of research. The state-of-the-art AND protocol proposed by Koch,Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number. Their protocol's minimality relies on somewhat complicated shuffles having non-uniform probabilities of possible outcomes. Restricting the allowed shuffles to "practical" ones, namely uniform closed shuffles, to our knowledge, six cards are sufficient: The sixcard AND protocol proposed by Mizuki and Sone in 2009 utilizes the random bisection cut, which is a uniform and cyclic (and hence, closed) shuffle. Thus, a question has arisen: Can we improve upon this six-card protocol using only practical shuffles? In other words, whether there exists a five-card AND protocol in committed format using only uniform closed shuffles has been one of the most important open questions in this field. In this paper, we answer the question affirmatively by designing a five-card committed-format AND protocol using only practical shuffles. The shuffles that our protocol uses are random cut and random bisection cut, both of which are uniform cyclic shuffles and can be easily implemented by humans.
KW - Card-Based Cryptography
KW - Deck of Cards
KW - Secure Multi-Party Computation
UR - http://www.scopus.com/inward/record.url?scp=85049399047&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049399047&partnerID=8YFLogxK
U2 - 10.1145/3197507.3197510
DO - 10.1145/3197507.3197510
M3 - Conference contribution
AN - SCOPUS:85049399047
T3 - APKC 2018 - Proceedings of the 5th ACM ASIA Public-Key Cryptography Workshop, Co-located with ASIA CCS 2018
SP - 3
EP - 8
BT - APKC 2018 - Proceedings of the 5th ACM ASIA Public-Key Cryptography Workshop, Co-located with ASIA CCS 2018
PB - Association for Computing Machinery, Inc
T2 - 5th ACM Asia Public-Key Cryptography Workshop, APKC 2018
Y2 - 4 June 2018
ER -