TY - GEN
T1 - How to implement a random bisection cut
AU - Ueda, Itaru
AU - Nishimura, Akihiro
AU - Hayashi, Yu Ichi
AU - Mizuki, Takaaki
AU - Sone, Hideaki
N1 - Funding Information:
We thank the anonymous referees, whose comments have helped us to improve the presentation of the paper. We would like to offer our special thanks to Kohei Yamaguchi, who provided an excellent implementation of the random bisection cut, the spinning throw, as introduced in Sect. . In addition, we are grateful to all members of the Sone-Mizuki laboratory in Tohoku University, who cooperated with our experiment in Sect. . This work was supported by JSPS KAKENHI Grant Number 26330001.
Publisher Copyright:
© Springer International Publishing AG 2016.
PY - 2016
Y1 - 2016
N2 - By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether the two halves of the card sequence are swapped or not. Because there are only two possibilities when a random bisection cut is performed, it has been suggested that information regarding the result of the shuffle could sometimes be leaked visually. Thus, in this paper we propose some methods for implementing a random bisection cut without leaking such information.
AB - By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether the two halves of the card sequence are swapped or not. Because there are only two possibilities when a random bisection cut is performed, it has been suggested that information regarding the result of the shuffle could sometimes be leaked visually. Thus, in this paper we propose some methods for implementing a random bisection cut without leaking such information.
KW - Card-based protocols
KW - Cryptography
KW - Real-life hands-on cryptography
KW - Secure multi-party computations
UR - http://www.scopus.com/inward/record.url?scp=85005949808&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85005949808&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-49001-4_5
DO - 10.1007/978-3-319-49001-4_5
M3 - Conference contribution
AN - SCOPUS:85005949808
SN - 9783319490007
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 58
EP - 69
BT - Theory and Practice of Natural Computing - 5th International Conference, TPNC 2016, Proceedings
A2 - Vega-Rodríguez, Miguel A.
A2 - Martín-Vide, Carlos
A2 - Mizuki, Takaaki
PB - Springer Verlag
T2 - 5th International Conference on Theory and Practice of Natural Computing, TPNC 2016
Y2 - 12 December 2016 through 13 December 2016
ER -