{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:51:53Z","timestamp":1778496713986,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T00:00:00Z","timestamp":1606435200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T00:00:00Z","timestamp":1606435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP17K00001"],"award-info":[{"award-number":["JP17K00001"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP19J21153"],"award-info":[{"award-number":["JP19J21153"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s10207-020-00525-4","type":"journal-article","created":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T12:03:54Z","timestamp":1606478634000},"page":"729-740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Evaluating card-based protocols in terms of execution time"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5818-8937","authenticated-orcid":false,"given":"Daiki","family":"Miyahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itaru","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1160-8156","authenticated-orcid":false,"given":"Yu-ichi","family":"Hayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8698-1043","authenticated-orcid":false,"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9395-9987","authenticated-orcid":false,"given":"Hideaki","family":"Sone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,27]]},"reference":[{"key":"525_CR1","doi-asserted-by":"crossref","unstructured":"Abe, Y., Hayashi, Y., Mizuki, T., Sone, H.: Five-card AND protocol in committed format using only practical shuffles. In: Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop. pp. 3\u20138. APKC \u201918, ACM, New York, NY, USA (2018)","DOI":"10.1145\/3197507.3197510"},{"key":"525_CR2","doi-asserted-by":"crossref","unstructured":"den Boer, B.: More efficient match-making and satisfiability the five card trick. In: Quisquater, J.J., Vandewalle, J. (eds.) Advances in Cryptology \u2013 EUROCRYPT \u201989. Lecture Notes in Computer Science, vol. 434, pp. 208\u2013217. Springer, Berlin (1990)","DOI":"10.1007\/3-540-46885-4_23"},{"key":"525_CR3","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) Advances in Cryptology \u2013 CRYPTO\u2019 93. Lecture Notes in Computer Science, vol. 773, pp. 319\u2013330. Springer, Berlin (1994)","DOI":"10.1007\/3-540-48329-2_27"},{"key":"525_CR4","doi-asserted-by":"crossref","unstructured":"Ishikawa, R., Chida, E., Mizuki, T.: Efficient card-based protocols for generating a hidden random permutation without fixed points. In: Calude, C.S., Dinneen, M.J. (eds.) Unconventional Computation and Natural Computation. Lecture Notes in Computer Science, vol. 9252, pp. 215\u2013226. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-21819-9_16"},{"key":"525_CR5","unstructured":"Koch, A.: The landscape of optimal card-based protocols. Cryptology ePrint Archive, Report 2018\/951 (2018). https:\/\/eprint.iacr.org\/2018\/951"},{"key":"525_CR6","doi-asserted-by":"crossref","unstructured":"Koch, A., Walzer, S., H\u00e4rtel, K.: Card-based cryptographic protocols using a minimal number of cards. In: Iwata, T., Cheon, J.H. (eds.) Advances in Cryptology\u2014ASIACRYPT 2015. Lecture Notes in Computer Science, vol. 9452, pp. 783\u2013807. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-48797-6_32"},{"key":"525_CR7","doi-asserted-by":"crossref","unstructured":"Miyahara, D., Ueda, I., Hayashi, Y., Mizuki, T., Sone, H.: Analyzing execution time of card-based protocols. In: Stepney, S., Verlan, S. (eds.) Unconventional Computation and Natural Computation. Lecture Notes in Computer Science, vol. 10867, pp. 145\u2013158. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-92435-9_11"},{"key":"525_CR8","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Asiedu, I.K., Sone, H.: Voting with a logarithmic number of cards. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) Unconventional Computation and Natural Computation. Lecture Notes in Computer Science, vol. 7956, pp. 162\u2013173. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-39074-6_16"},{"key":"525_CR9","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Kumamoto, M., Sone, H.: The five-card trick can be done with four cards. In: Wang, X., Sako, K. (eds.) Advances in Cryptology\u2014ASIACRYPT 2012. Lecture Notes in Computer Science, vol. 7658, pp. 598\u2013606. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-34961-4_36"},{"issue":"1","key":"525_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10207-013-0219-4","volume":"13","author":"T Mizuki","year":"2014","unstructured":"Mizuki, T., Shizuya, H.: A formalization of card-based cryptographic protocols via abstract machine. Int. J. Inf. Secur. 13(1), 15\u201323 (2014)","journal-title":"Int. J. Inf. Secur."},{"key":"525_CR11","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Shizuya, H.: Practical card-based cryptography. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) Fun with Algorithms. Lecture Notes in Computer Science, vol. 8496, pp. 313\u2013324. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-07890-8_27"},{"key":"525_CR12","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Shizuya, H.: Computational model of card-based cryptographic protocols and its applications. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100.A(1), 3\u201311 (2017)","DOI":"10.1587\/transfun.E100.A.3"},{"key":"525_CR13","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) Frontiers in Algorithmics. Lecture Notes in Computer Science, vol. 5598, pp. 358\u2013369. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02270-8_36"},{"key":"525_CR14","doi-asserted-by":"crossref","unstructured":"Nakai, T., Shirouchi, S., Iwamoto, M., Ohta, K.: Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations. In: Shikata, J. (ed.) Information Theoretic Security. Lecture Notes in Computer Science, vol. 10681, pp. 153\u2013165. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-72089-0_9"},{"issue":"1\u20132","key":"525_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0304-3975(97)00107-2","volume":"191","author":"V Niemi","year":"1998","unstructured":"Niemi, V., Renvall, A.: Secure multiparty computations without computers. Theor. Comput. Sci. 191(1\u20132), 173\u2013183 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"525_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2858-2","author":"A Nishimura","year":"2017","unstructured":"Nishimura, A., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols using unequal division shuffles. Soft Comput. (2017). https:\/\/doi.org\/10.1007\/s00500-017-2858-2","journal-title":"Soft Comput."},{"key":"525_CR17","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Efficient card-based cryptographic protocols for the millionaires\u2019 problem using private input operations. In: 2018 13th Asia Joint Conference on Information Security (AsiaJCIS). pp. 23\u201328 (2018)","DOI":"10.1109\/AsiaJCIS.2018.00013"},{"key":"525_CR18","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic protocols with the minimum number of cards using private operations. In: Zincir-Heywood, N., Bonfante, G., Debbabi, M., Garcia-Alfaro, J. (eds.) Foundations and Practice of Security. Lecture Notes in Computer Science, vol. 11358, pp. 193\u2013207. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-18419-3_13"},{"key":"525_CR19","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic protocols with the minimum number of rounds using private operations. In: P\u00e9rez-Sol\u00e0, C., Navarro-Arribas, G., Biryukov, A., Garcia-Alfaro, J. (eds.) Data Privacy Management, Cryptocurrencies and Blockchain Technology. Lecture Notes in Computer Science, vol. 11737, pp. 156\u2013173. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-31500-9_10"},{"key":"525_CR20","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: And protocols using only uniform shuffles. In: van Bevern, R., Kucherov, G. (eds.) Computer Science\u2014Theory and Applications. Lecture Notes in Computer Science, vol. 11532, pp. 349\u2013358. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-19955-5_30"},{"issue":"6","key":"525_CR21","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1587\/transfun.E99.A.1122","volume":"99\u2013A","author":"K Shinagawa","year":"2016","unstructured":"Shinagawa, K., Mizuki, T., Schuldt, J.C.N., Nuida, K., Kanayama, N., Nishide, T., Hanaoka, G., Okamoto, E.: Secure computation protocols using polarizing cards. IEICE Trans. 99\u2013A(6), 1122\u20131131 (2016)","journal-title":"IEICE Trans."},{"issue":"9","key":"525_CR22","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1587\/transfun.E100.A.1900","volume":"E100.A","author":"K Shinagawa","year":"2017","unstructured":"Shinagawa, K., Mizuki, T., Schuldt, J.C., Nuida, K., Kanayama, N., Nishide, T., Hanaoka, G., Okamoto, E.: Card-based protocols using regular polygon cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E100.A(9), 1900\u20131909 (2017)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1\u20132","key":"525_CR23","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0304-3975(00)00409-6","volume":"259","author":"A Stiglic","year":"2001","unstructured":"Stiglic, A.: Computations with a deck of cards. Theor. Comput. Sci. 259(1\u20132), 671\u2013678 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"525_CR24","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10207-019-00463-w","volume":"19","author":"I Ueda","year":"2020","unstructured":"Ueda, I., Miyahara, D., Nishimura, A., Hayashi, Yi, Mizuki, T., Sone, H.: Secure implementations of a random bisection cut. Int. J. Inf. Secur. 19(4), 445\u2013452 (2020). https:\/\/doi.org\/10.1007\/s10207-019-00463-w","journal-title":"Int. J. Inf. Secur."},{"key":"525_CR25","doi-asserted-by":"crossref","unstructured":"Ueda, I., Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: How to implement a random bisection cut. In: Mart\u00edn-Vide, C., Mizuki, T., Vega-Rodr\u00edguez, M.A. (eds.) Theory and Practice of Natural Computing. Lecture Notes in Computer Science, vol. 10071, pp. 58\u201369. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-49001-4_5"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00525-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-020-00525-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00525-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T04:58:52Z","timestamp":1669784332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-020-00525-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,27]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["525"],"URL":"https:\/\/doi.org\/10.1007\/s10207-020-00525-4","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,27]]},"assertion":[{"value":"27 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This article does not contain any new studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}