TY - JOUR
T1 - Card-based protocols using regular polygon cards
AU - Shinagawa, Kazumasa
AU - Mizuki, Takaaki
AU - Schuldt, Jacob C.N.
AU - Nuida, Koji
AU - Kanayama, Naoki
AU - Nishide, Takashi
AU - Hanaoka, Goichiro
AU - Okamoto, Eiji
N1 - Funding Information:
The authors would like to thank members of the study group “Shin-Akarui-Angou-Benkyou-Kai” for the valuable discussions and helpful comments. We also thank the editor and the anonymous reviewers, whose comments helped us to improve the presentation of this paper. This work was partially supported by JSPS KAKENHI Grant Numbers 26330001 and 26330151.
Publisher Copyright:
Copyright © 2017 The Institute of Electronics, Information and Communication Engineers.
PY - 2017/9
Y1 - 2017/9
N2 - Cryptographic protocols enable participating parties to compute any function of their inputs without leaking any information beyond the output. A card-based protocol is a cryptographic protocol implemented by physical cards. In this paper, for constructing protocols with small numbers of shuffles, we introduce a new type of cards, regular polygon cards, and a new protocol, oblivious conversion. Using our cards, we construct an addition protocol on non-binary inputs with only one shuffle and two cards. Furthermore, using our oblivious conversion protocol, we construct the first protocol for general functions in which the number of shuffles is linear in the number of inputs.
AB - Cryptographic protocols enable participating parties to compute any function of their inputs without leaking any information beyond the output. A card-based protocol is a cryptographic protocol implemented by physical cards. In this paper, for constructing protocols with small numbers of shuffles, we introduce a new type of cards, regular polygon cards, and a new protocol, oblivious conversion. Using our cards, we construct an addition protocol on non-binary inputs with only one shuffle and two cards. Furthermore, using our oblivious conversion protocol, we construct the first protocol for general functions in which the number of shuffles is linear in the number of inputs.
UR - http://www.scopus.com/inward/record.url?scp=85028745586&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028745586&partnerID=8YFLogxK
U2 - 10.1587/transfun.E100.A.1900
DO - 10.1587/transfun.E100.A.1900
M3 - Article
AN - SCOPUS:85028745586
SN - 0916-8508
VL - E100A
SP - 1900
EP - 1909
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IS - 9
ER -