TY - GEN
T1 - Analyzing execution time of card-based protocols
AU - Miyahara, Daiki
AU - Ueda, Itaru
AU - Hayashi, Yu-Ichi
AU - Mizuki, Takaaki
AU - Sone, Hideaki
N1 - Funding Information:
Acknowledgments. We thank the anonymous referees, whose comments have helped us to improve the presentation of the paper. This work was supported by JSPS KAK-ENHI Grant Number JP17K00001.
PY - 2018
Y1 - 2018
N2 - Card-based cryptography is an attractive and unconventional computation model; it provides secure computing methods using a deck of physical cards. It is noteworthy that a card-based protocol can be easily executed by non-experts such as high school students without the use of any electric device. One of the main goals in this discipline is to develop efficient protocols. The efficiency has been evaluated by the number of required cards, the number of colors, and the average number of protocol trials. Although these evaluation metrics are simple and reasonable, it is difficult to estimate the total number of operations or execution time of protocols based only on these three metrics. Therefore, in this paper, we consider adding other metrics to estimate the execution time of protocols more precisely. Furthermore, we actually evaluate some of the important existing protocols using our new criteria.
AB - Card-based cryptography is an attractive and unconventional computation model; it provides secure computing methods using a deck of physical cards. It is noteworthy that a card-based protocol can be easily executed by non-experts such as high school students without the use of any electric device. One of the main goals in this discipline is to develop efficient protocols. The efficiency has been evaluated by the number of required cards, the number of colors, and the average number of protocol trials. Although these evaluation metrics are simple and reasonable, it is difficult to estimate the total number of operations or execution time of protocols based only on these three metrics. Therefore, in this paper, we consider adding other metrics to estimate the execution time of protocols more precisely. Furthermore, we actually evaluate some of the important existing protocols using our new criteria.
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=85049022650&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049022650&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-92435-9_11
DO - 10.1007/978-3-319-92435-9_11
M3 - Conference contribution
AN - SCOPUS:85049022650
SN - 9783319924342
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 145
EP - 158
BT - Unconventional Computation and Natural Computation - 17th International Conference, UCNC 2018, Proceedings
A2 - Stepney, Susan
A2 - Verlan, Sergey
PB - Springer Verlag
T2 - 17th International Conference on Unconventional Computation and Natural Computation, UCNC 2018
Y2 - 25 June 2018 through 29 June 2018
ER -