{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:06:30Z","timestamp":1743699990637,"version":"3.40.3"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_33","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"469-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6312-257X","authenticated-orcid":false,"given":"Yoshifumi","family":"Manabe","sequence":"first","affiliation":[]},{"given":"Hibiki","family":"Ono","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Abe, Y., Hayashi, Y.I., Mizuki, T., Sone, H.: Five-card and computations in committed format using only uniform cyclic shuffles. New Gener. Comput. 39(1), 97\u2013114 (2021)","DOI":"10.1007\/s00354-020-00110-2"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-46885-4_23","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"B den Boer","year":"1990","unstructured":"den Boer, B.: More efficient match-making and satisfiability The Five Card Trick. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 208\u2013217. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_23"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-03232-6_8","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"X Bultel","year":"2018","unstructured":"Bultel, X., et al.: Physical zero-knowledge proof for Makaro. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 111\u2013125. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_8"},{"key":"33_CR4","unstructured":"Cheung, E., Hawthorne, C., Lee, P.: Cs 758 project: secure computation with playing cards (2013). http:\/\/cdchawthorne.com\/writings\/secure_playing_cards.pdf"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-48329-2_27","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"C Cr\u00e9peau","year":"1994","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 319\u2013330. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_27"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-26176-4_14","volume-title":"Computing and Combinatorics","author":"J-G Dumas","year":"2019","unstructured":"Dumas, J.-G., Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: Interactive physical zero-knowledge proof for Norinori. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 166\u2013177. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_14"},{"key":"33_CR7","unstructured":"Dvo\u0159\u00e1k, P., Kouck\u1ef3, M.: Barrington plays cards: the complexity of card-based protocols. arXiv preprint arXiv:2010.08445 (2020)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-61273-7_10","volume-title":"Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology","author":"D Francis","year":"2017","unstructured":"Francis, D., Aljunid, S.R., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Necessary and sufficient numbers of cards for securely computing two-bit output functions. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 193\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_10"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Hashimoto, Y., Nuida, K., Shinagawa, K., Inamura, M., Hanaoka, G.: Toward finite-runtime card-based protocol for generating hidden random permutation without fixed points. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 101-A(9), 1503\u20131511 (2018)","DOI":"10.1587\/transfun.E101.A.1503"},{"issue":"9","key":"33_CR10","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1587\/transfun.E101.A.1512","volume":"101","author":"Y Hashimoto","year":"2018","unstructured":"Hashimoto, Y., Shinagawa, K., Nuida, K., Inamura, M., Hanaoka, G.: Secure grouping protocol using a deck of cards. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 101(9), 1512\u20131524 (2018)","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Ibaraki, T., Manabe, Y.: A more efficient card-based protocol for generating a random permutation without fixed points. In: Proceedings of 3rd International Conference on Mathematics and Computers in Sciences and in Industry (MCSI 2016), pp. 252\u2013257 (2016)","DOI":"10.1109\/MCSI.2016.054"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-21819-9_16","volume-title":"Unconventional Computation and Natural Computation","author":"R Ishikawa","year":"2015","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.) UCNC 2015. LNCS, vol. 9252, pp. 215\u2013226. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21819-9_16"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-70700-6_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"J Kastner","year":"2017","unstructured":"Kastner, J., Koch, A., Walzer, S., Miyahara, D., Hayashi, Y., Mizuki, T., Sone, H.: The minimum number of cards in practical card-based protocols. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part III. LNCS, vol. 10626, pp. 126\u2013155. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_5"},{"key":"33_CR14","unstructured":"Koch, A.: The landscape of optimal card-based protocols. IACR Cryptology ePrint Archive, Report 2018\/951 (2018)"},{"issue":"1","key":"33_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00354-020-00120-0","volume":"39","author":"A Koch","year":"2021","unstructured":"Koch, A., Schrempp, M., Kirsten, M.: Card-based cryptography meets formal verification. New Gener. Comput. 39(1), 115\u2013158 (2021)","journal-title":"New Gener. Comput."},{"key":"33_CR16","unstructured":"Koch, A., Walzer, S.: Private function evaluation with cards. Cryptology ePrint Archive, Report 2018\/1113 (2018). https:\/\/eprint.iacr.org\/2018\/1113"},{"key":"33_CR17","unstructured":"Koch, A., Walzer, S.: Foundations for actively secure card-based cryptography. In: Proceedings of 10th International Conference on Fun with Algorithms (FUN 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/978-3-662-48797-6_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Koch","year":"2015","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.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 783\u2013807. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_32"},{"key":"33_CR19","unstructured":"Kurosawa, K., Shinozaki, T.: Compact card protocol. In: Proceedings of 2017 Symposium on Cryptography and Information Security (SCIS 2017), pp. 1A2-6 (2017). (in Japanese)"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-34339-2_8","volume-title":"Information Security Practice and Experience","author":"P Lafourcade","year":"2019","unstructured":"Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: A physical ZKP for Slitherlink: how to perform physical topology-preserving computation. In: Heng, S.-H., Lopez, J. (eds.) ISPEC 2019. LNCS, vol. 11879, pp. 135\u2013151. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34339-2_8"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-69255-1_5","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"Y Manabe","year":"2021","unstructured":"Manabe, Y., Ono, H.: Secure card-based cryptographic protocols using private operations against malicious players. In: Maimut, D., Oprina, A.-G., Sauveron, D. (eds.) SecITC 2020. LNCS, vol. 12596, pp. 55\u201370. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-69255-1_5"},{"key":"33_CR22","unstructured":"Marcedone, A., Wen, Z., Shi, E.: Secure dating with four or fewer cards. IACR Cryptology ePrint Archive, Report 2015\/1031 (2015)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Miyahara, D., Hayashi, Y.i., Mizuki, T., Sone, H.: Practical card-based implementations of Yao\u2019s millionaire protocol. Theor. Comput. Sci. 803, 207\u2013221 (2020)","DOI":"10.1016\/j.tcs.2019.11.005"},{"key":"33_CR24","unstructured":"Miyahara, D., et al.: Card-based ZKP protocols for Takuzu and Juosan. In: Proceedings of 10th International Conference on Fun with Algorithms (FUN 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"9","key":"33_CR25","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1587\/transfun.E102.A.1072","volume":"102","author":"D Miyahara","year":"2019","unstructured":"Miyahara, D., Sasaki, T., Mizuki, T., Sone, H.: Card-based physical zero-knowledge proof for Kakuro. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 102(9), 1072\u20131078 (2019)","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"key":"33_CR26","unstructured":"Mizuki, T.: Applications of card-based cryptography to education. IEICE Techinical Report ISEC2016-53, pp. 13\u201317 (2016). (in Japanese)"},{"key":"33_CR27","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2016.01.039","volume":"622","author":"T Mizuki","year":"2016","unstructured":"Mizuki, T.: Card-based protocols for securely computing the conjunction of multiple variables. Theor. Comput. Sci. 622, 34\u201344 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-39074-6_16","volume-title":"Unconventional Computation and Natural Computation","author":"T Mizuki","year":"2013","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.) UCNC 2013. LNCS, vol. 7956, pp. 162\u2013173. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39074-6_16"},{"key":"33_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-34961-4_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T Mizuki","year":"2012","unstructured":"Mizuki, T., Kumamoto, M., Sone, H.: The five-card trick can be done with four cards. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 598\u2013606. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_36"},{"issue":"1","key":"33_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1587\/transfun.E100.A.3","volume":"100","author":"T Mizuki","year":"2017","unstructured":"Mizuki, T., Shizuya, H.: Computational model of card-based cryptographic protocols and its applications. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 100(1), 3\u201311 (2017)","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"key":"33_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-02270-8_36","volume-title":"Frontiers in Algorithmics","author":"T Mizuki","year":"2009","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 358\u2013369. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_36"},{"key":"33_CR32","first-page":"279","volume":"36","author":"T Mizuki","year":"2006","unstructured":"Mizuki, T., Uchiike, F., Sone, H.: Securely computing XOR with 10 cards. Australas. J. Comb. 36, 279\u2013293 (2006)","journal-title":"Australas. J. Comb."},{"key":"33_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-68211-8_7","volume-title":"WALCOM: Algorithms and Computation","author":"S Murata","year":"2021","unstructured":"Murata, S., Miyahara, D., Mizuki, T., Sone, H.: Efficient generation of a card-based uniformly distributed random derangement. In: Uehara, R., Hong, S.-H., Nandy, S.C. (eds.) WALCOM 2021. LNCS, vol. 12635, pp. 78\u201389. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68211-8_7"},{"issue":"1","key":"33_CR34","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00354-020-00118-8","volume":"39","author":"T Nakai","year":"2021","unstructured":"Nakai, T., Misawa, Y., Tokushige, Y., Iwamoto, M., Ohta, K.: How to solve millionaires\u2019 problem with two kinds of cards. New Gener. Comput. 39(1), 73\u201396 (2021)","journal-title":"New Gener. Comput."},{"key":"33_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-72089-0_9","volume-title":"Information Theoretic Security","author":"T Nakai","year":"2017","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.) ICITS 2017. LNCS, vol. 10681, pp. 153\u2013165. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72089-0_9"},{"issue":"1","key":"33_CR36","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), 173\u2013183 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-17142-5_11","volume-title":"Theory and Applications of Models of Computation","author":"T Nishida","year":"2015","unstructured":"Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols for any Boolean function. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 110\u2013121. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_11"},{"issue":"6","key":"33_CR38","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1587\/transfun.E98.A.1145","volume":"98","author":"T Nishida","year":"2015","unstructured":"Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Securely computing three-input functions with eight cards. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 98(6), 1145\u20131152 (2015)","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"issue":"2","key":"33_CR39","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00500-017-2858-2","volume":"22","author":"A Nishimura","year":"2018","unstructured":"Nishimura, A., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols using unequal division shuffles. Soft. Comput. 22(2), 361\u2013371 (2018)","journal-title":"Soft. Comput."},{"key":"33_CR40","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Efficient card-based cryptographic protocols for the millionaires\u2019 problem using private input operations. In: Proceedings of 13th Asia Joint Conference on Information Security (AsiaJCIS 2018), pp. 23\u201328 (2018)","DOI":"10.1109\/AsiaJCIS.2018.00013"},{"key":"33_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-31500-9_10","volume-title":"Data Privacy Management, Cryptocurrencies and Blockchain Technology","author":"H Ono","year":"2019","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.) DPM\/CBT -2019. LNCS, vol. 11737, pp. 156\u2013173. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31500-9_10"},{"issue":"1","key":"33_CR42","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00354-020-00113-z","volume":"39","author":"H Ono","year":"2021","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic logical computations using private operations. New Gener. Comput. 39(1), 19\u201340 (2021)","journal-title":"New Gener. Comput."},{"key":"33_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-030-64348-5_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Robert","year":"2020","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Physical zero-knowledge proof for Suguru puzzle. In: Devismes, S., Mittal, N. (eds.) SSS 2020. LNCS, vol. 12514, pp. 235\u2013247. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_19"},{"key":"33_CR44","doi-asserted-by":"crossref","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Interactive physical ZKP for connectivity: applications to nurikabe and hitori. In: Proceedings of 17th International Conference on Computability in Europe (CiE 2021). LNCS (2021)","DOI":"10.1007\/978-3-030-80049-9_37"},{"key":"33_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-19955-5_30","volume-title":"Computer Science \u2013 Theory and Applications","author":"S Ruangwises","year":"2019","unstructured":"Ruangwises, S., Itoh, T.: AND protocols using only uniform shuffles. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 349\u2013358. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_30"},{"key":"33_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-030-59267-7_3","volume-title":"Theory and Applications of Models of Computation","author":"S Ruangwises","year":"2020","unstructured":"Ruangwises, S., Itoh, T.: Securely computing the n-variable equality function with 2n cards. In: Chen, J., Feng, Q., Xu, J. (eds.) TAMC 2020. LNCS, vol. 12337, pp. 25\u201336. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59267-7_3"},{"issue":"1","key":"33_CR47","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00354-020-00114-y","volume":"39","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for number link puzzle and k vertex-disjoint paths problem. New Gener. Comput. 39(1), 3\u201317 (2021)","journal-title":"New Gener. Comput."},{"key":"33_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-030-68211-8_24","volume-title":"WALCOM: Algorithms and Computation","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for ripple effect. In: Uehara, R., Hong, S.-H., Nandy, S.C. (eds.) WALCOM 2021. LNCS, vol. 12635, pp. 296\u2013307. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68211-8_24"},{"key":"33_CR49","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2020.05.036","volume":"839","author":"T Sasaki","year":"2020","unstructured":"Sasaki, T., Miyahara, D., Mizuki, T., Sone, H.: Efficient card-based zero-knowledge proof for Sudoku. Theor. Comput. Sci. 839, 135\u2013142 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR50","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-79812-2","volume-title":"Progress in Applications of Boolean Functions","author":"T Sasao","year":"2010","unstructured":"Sasao, T., Butler, J.T.: Progress in Applications of Boolean Functions. Morgan and Claypool Publishers, San Franciso (2010)"},{"key":"33_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-12146-4_8","volume-title":"Information Security and Cryptology \u2013 ICISC 2018","author":"K Shinagawa","year":"2019","unstructured":"Shinagawa, K., Mizuki, T.: The six-card trick: secure computation of three-input equality. In: Lee, K. (ed.) ICISC 2018. LNCS, vol. 11396, pp. 123\u2013131. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12146-4_8"},{"key":"33_CR52","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.dam.2020.10.013","volume":"289","author":"K Shinagawa","year":"2021","unstructured":"Shinagawa, K., Nuida, K.: A single shuffle is enough for secure card-based computation of any Boolean circuit. Discrete App. Math. 289, 248\u2013261 (2021)","journal-title":"Discrete App. Math."},{"key":"33_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-030-69255-1_17","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"Y Shinoda","year":"2021","unstructured":"Shinoda, Y., Miyahara, D., Shinagawa, K., Mizuki, T., Sone, H.: Card-based covert lottery. In: Maimut, D., Oprina, A.-G., Sauveron, D. (eds.) SecITC 2020. LNCS, vol. 12596, pp. 257\u2013270. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-69255-1_17"},{"key":"33_CR54","unstructured":"Shirouchi, S., Nakai, T., Iwamoto, M., Ohta, K.: Efficient card-based cryptographic protocols for logic gates utilizing private permutations. In: Proceedings of 2017 Symposium on Cryptography and InformationSecurity (SCIS 2017), p. 1A2-2 (2017). (in Japanese)"},{"issue":"1","key":"33_CR55","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), 671\u2013678 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR56","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2020.09.008","volume":"845","author":"K Takashima","year":"2020","unstructured":"Takashima, K., et al.: Card-based protocols for secure ranking computations. Theor. Comput. Sci. 845, 122\u2013135 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR57","doi-asserted-by":"crossref","unstructured":"Takashima, K., Miyahara, D., Mizuki, T., Sone, H.: Actively revealing card attack on card-based protocols. Nat. Comput. 1\u201314 (2021)","DOI":"10.1007\/s11047-020-09838-8"},{"key":"33_CR58","doi-asserted-by":"crossref","unstructured":"Toyoda, K., Miyahara, D., Mizuki, T., Sone, H.: Six-card finite-runtime XOR protocol with only random cut. In: Proceedings of the 7th ACM Workshop on ASIA Public-Key Cryptography, pp. 2\u20138 (2020)","DOI":"10.1145\/3384940.3388961"},{"key":"33_CR59","doi-asserted-by":"crossref","unstructured":"Watanabe, Y., Kuroki, Y., Suzuki, S., Koga, Y., Iwamoto, M., Ohta, K.: Card-based majority voting protocols with three inputs using three cards. In: Proceedings of 2018 International Symposium on Information Theory and its Applications (ISITA), pp. 218\u2013222. IEEE (2018)","DOI":"10.23919\/ISITA.2018.8664324"},{"key":"33_CR60","doi-asserted-by":"publisher","unstructured":"Yasunaga, K.: Practical card-based protocol for three-input majority. IEICE Transactions on Fundamentals of Electronics, Commun. Comput. Sci. E103.A(11), 1296\u20131298 (2020). https:\/\/doi.org\/10.1587\/transfun.2020EAL2025","DOI":"10.1587\/transfun.2020EAL2025"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T01:57:59Z","timestamp":1672624679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}