{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:09Z","timestamp":1772893029882,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031207952","type":"print"},{"value":"9783031207969","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":365,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Card-based cryptography started with the \u201cfive-card trick\u201d designed by Den Boer (EUROCRYPT 1989); it enables Alice and Bob to securely evaluate the AND value of their private bits using a physical deck of five cards. It was then shown that the same task can be done with only four cards, i.e., Mizuki et al. proposed a four-card AND protocol (ASIACRYPT 2012). These two AND protocols are simple and easy even for non-experts, such as high school students, to execute. Their only common drawback is the need to prepare a customized deck consisting of red and black cards such that all cards of the same color must be identical. Fortunately, several existing protocols are based on a standard deck of playing cards (commercially available). Among them, the state-of-the-art AND protocol was constructed by Koch et al. (ASIACRYPT 2019); it uses four playing cards (such as \u2018A, J, Q, K\u2019) to securely evaluate the AND value. The protocol is elaborate, while its possible drawback is the need to repeat a shuffling operation six times (in expectation), which makes it less practical.<\/jats:p><jats:p>This paper aims to provide the first practical protocol working on a standard deck of playing cards. We present an extremely simple AND protocol that terminates after only one shuffle using only four cards; our proposed protocol relies on a new operation, called the \u201chalf-open\u201d action, whereby players can check only the suit of a face-down card without revealing the number on it. We believe that this new operation is easy-to-implement, and hence, our four-card AND protocol working on a standard deck is practical. We formalize the half-open action to present a formal description of our proposed protocol. Moreover, we discuss what is theoretically implied by introducing the half-open action and show that it can be applied to efficiently solving Yao\u2019s Millionaires\u2019 problem with a standard deck of cards.<\/jats:p>","DOI":"10.1007\/978-3-031-20796-9_9","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"110-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Secure Computations Through Checking Suits of\u00a0Playing Cards"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5818-8937","authenticated-orcid":false,"given":"Daiki","family":"Miyahara","sequence":"first","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"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"9_CR1","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":"9_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 Boer","year":"1990","unstructured":"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":"9_CR3","doi-asserted-by":"publisher","unstructured":"Dvo\u0159\u00e1k, P., Kouck\u00fd, M.: Barrington plays cards: the complexity of card-based protocols. In: Bl\u00e4ser, M., Monmege, B. (eds.) Theoretical Aspects of Computer Science. LIPIcs, vol. 187, pp. 26:1\u201326:17. Schloss Dagstuhl, Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.26","DOI":"10.4230\/LIPIcs.STACS.2021.26"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00224-008-9119-9","volume":"44","author":"R Gradwohl","year":"2009","unstructured":"Gradwohl, R., Naor, M., Pinkas, B., Rothblum, G.N.: Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles. Theor. Comput. Syst. 44(2), 245\u2013268 (2009). https:\/\/doi.org\/10.1007\/s00224-008-9119-9","journal-title":"Theor. Comput. Syst."},{"key":"9_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-031-17433-9_19","volume-title":"AFRICACRYPT 2022","author":"R Haga","year":"2022","unstructured":"Haga, R., Hayashi, Y., Miyahara, D., Mizuki, T.: Card-minimal protocols for three-input functions with standard playing cards. In: Batina, L., Daemen, J. (eds.) AFRICACRYPT 2022. LNCS, vol. 13503, pp. 448\u2013468. LNCS, Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17433-9_19"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Ibaraki, T., Manabe, Y.: A more efficient card-based protocol for generating a random permutation without fixed points. In: Mathematics and Computers in Sciences and in Industry (MCSI), pp. 252\u2013257 (2016). https:\/\/doi.org\/10.1109\/MCSI.2016.054","DOI":"10.1109\/MCSI.2016.054"},{"key":"9_CR7","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":"9_CR8","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., et al.: The minimum number of cards in practical card-based protocols. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 126\u2013155. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_5"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Koch, A.: Cryptographic protocols from physical assumptions. Ph.D. thesis, Karlsruhe Institute of Technology (2019). https:\/\/doi.org\/10.5445\/IR\/1000097756","DOI":"10.5445\/IR\/1000097756"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-030-34578-5_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"A Koch","year":"2019","unstructured":"Koch, A., Schrempp, M., Kirsten, M.: Card-based cryptography meets formal verification. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 488\u2013517. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_18"},{"issue":"1","key":"9_CR11","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). https:\/\/doi.org\/10.1007\/s00354-020-00120-0","journal-title":"New Gener. Comput."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00354-021-00149-9","volume":"40","author":"A Koch","year":"2022","unstructured":"Koch, A., Walzer, S.: Private function evaluation with cards. New Gener. Comput. 40, 115\u2013147 (2022). https:\/\/doi.org\/10.1007\/s00354-021-00149-9","journal-title":"New Gener. Comput."},{"key":"9_CR13","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":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-030-79416-3_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"H Koyama","year":"2021","unstructured":"Koyama, H., Miyahara, D., Mizuki, T., Sone, H.: A secure three-input AND protocol with\u00a0a\u00a0standard deck of minimal cards. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 242\u2013256. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_14"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Koyama, H., Toyoda, K., Miyahara, D., Mizuki, T.: New card-based copy protocols using only random cuts. In: ASIA Public-Key Cryptography Workshop, pp. 13\u201322. ACM, New York (2021). https:\/\/doi.org\/10.1145\/3457338.3458297","DOI":"10.1145\/3457338.3458297"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Kuzuma, T., Toyoda, K., Miyahara, D., Mizuki, T.: Card-based single-shuffle protocols for secure multiple-input AND and XOR computations. In: ASIA Public-Key Cryptography, pp. 1\u20138. ACM, New York (2022, to appear). https:\/\/doi.org\/10.1145\/3494105.3526236","DOI":"10.1145\/3494105.3526236"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2021.07.019","volume":"888","author":"P Lafourcade","year":"2021","unstructured":"Lafourcade, P., Miyahara, D., Mizuki, T., Robert, L., Sasaki, T., Sone, H.: How to construct physical zero-knowledge proofs for puzzles with a \u201csingle loop\u2019\u2019 condition. Theor. Comput. Sci. 888, 41\u201355 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.07.019","journal-title":"Theor. Comput. Sci."},{"key":"9_CR18","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-23451-5_7","volume-title":"Information Security Education. Education in Proactive Information Security","author":"P Lafourcade","year":"2019","unstructured":"Lafourcade, P., Mizuki, T., Nagao, A., Shinagawa, K.: Light cryptography. In: Drevin, L., Theocharidou, M. (eds.) WISE 2019. IFIP AICT, vol. 557, pp. 89\u2013101. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23451-5_7"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-85315-0_15","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2021","author":"Y Manabe","year":"2021","unstructured":"Manabe, Y., Ono, H.: Card-based cryptographic protocols with a standard deck of cards using private operations. In: Cerone, A., \u00d6lveczky, P.C. (eds.) ICTAC 2021. LNCS, vol. 12819, pp. 256\u2013274. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85315-0_15"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00354-021-00148-w","volume":"40","author":"Y Manabe","year":"2022","unstructured":"Manabe, Y., Ono, H.: Card-based cryptographic protocols with malicious players using private operations. New Gener. Comput. 40, 67\u201393 (2022). https:\/\/doi.org\/10.1007\/s00354-021-00148-w","journal-title":"New Gener. Comput."},{"key":"9_CR21","unstructured":"Marcedone, A., Wen, Z., Shi, E.: Secure dating with four or fewer cards. Cryptology ePrint Archive, Report 2015\/1031 (2015)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-030-90402-9_8","volume-title":"Provable and Practical Security","author":"D Miyahara","year":"2021","unstructured":"Miyahara, D., Haneda, H., Mizuki, T.: Card-based zero-knowledge proof protocols for graph problems and their computational model. In: Huang, Q., Yu, Yu. (eds.) ProvSec 2021. LNCS, vol. 13059, pp. 136\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90402-9_8"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2019.11.005","volume":"803","author":"D Miyahara","year":"2020","unstructured":"Miyahara, D., Hayashi, Y., Mizuki, T., Sone, H.: Practical card-based implementations of Yao\u2019s millionaire protocol. Theor. Comput. Sci. 803, 207\u2013221 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.11.005","journal-title":"Theor. Comput. Sci."},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Miyahara, D., Komano, Y., Mizuki, T., Sone, H.: Cooking cryptographers: Secure multiparty computation based on balls and bags. In: Computer Security Foundations Symposium, pp. 1\u201316. IEEE, New York (2021). https:\/\/doi.org\/10.1109\/CSF51468.2021.00034","DOI":"10.1109\/CSF51468.2021.00034"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Miyamoto, K., Shinagawa, K.: Graph automorphism shuffles from pile-scramble shuffles. New Gener. Comput. 40, 199\u2013223 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00164-4","DOI":"10.1007\/s00354-022-00164-4"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-319-48965-0_29","volume-title":"Cryptology and Network Security","author":"T Mizuki","year":"2016","unstructured":"Mizuki, T.: Efficient and secure multiparty computations using a standard deck of playing cards. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 484\u2013499. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_29"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00354-021-00127-1","volume":"39","author":"T Mizuki","year":"2021","unstructured":"Mizuki, T.: Preface: special issue on card-based cryptography. New Gener. Comput. 39(1), 1\u20132 (2021). https:\/\/doi.org\/10.1007\/s00354-021-00127-1","journal-title":"New Gener. Comput."},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Mizuki, T.: Preface: special issue on card-based cryptography 2. New Gener. Comput. 40, 47\u201348 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00170-6","DOI":"10.1007\/s00354-022-00170-6"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Mizuki, T., Komano, Y.: Information leakage due to operative errors in card-based protocols. Inf. Comput., 1\u201315 (2022). https:\/\/doi.org\/10.1016\/j.ic.2022.104910,in press","DOI":"10.1016\/j.ic.2022.104910,"},{"key":"9_CR30","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":"9_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10207-013-0219-4","volume":"13","author":"T Mizuki","year":"2013","unstructured":"Mizuki, T., Shizuya, H.: A formalization of card-based cryptographic protocols via abstract machine. Int. J. Inf. Secur. 13(1), 15\u201323 (2013). https:\/\/doi.org\/10.1007\/s10207-013-0219-4","journal-title":"Int. J. Inf. Secur."},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Mizuki, T., Shizuya, H.: Computational model of card-based cryptographic protocols and its applications. IEICE Trans. Fundam. E100.A(1), 3\u201311 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.3","DOI":"10.1587\/transfun.E100.A.3"},{"key":"9_CR33","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":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-62974-8_4","volume-title":"Information Security","author":"S Murata","year":"2020","unstructured":"Murata, S., Miyahara, D., Mizuki, T., Sone, H.: Public-PEZ cryptography. In: Susilo, W., Deng, R.H., Guo, F., Li, Y., Intan, R. (eds.) ISC 2020. LNCS, vol. 12472, pp. 59\u201374. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62974-8_4"},{"key":"9_CR35","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00354-022-00153-7","volume":"40","author":"T Nakai","year":"2022","unstructured":"Nakai, T., Misawa, Y., Tokushige, Y., Iwamoto, M., Ohta, K.: Secure computation for threshold functions with physical cards: power of private permutations. New Gener. Comput. 40, 95\u2013113 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00153-7","journal-title":"New Gener. Comput."},{"issue":"1","key":"9_CR36","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). https:\/\/doi.org\/10.1007\/s00354-020-00118-8","journal-title":"New Gener. Comput."},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Niemi, V., Renvall, A.: Solitaire zero-knowledge. Fundam. Inf. 38(1,2), 181\u2013188 (1999), https:\/\/doi.org\/10.3233\/FI-1999-381214","DOI":"10.3233\/FI-1999-381214"},{"issue":"1","key":"9_CR38","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00354-020-00113-z","volume":"39","author":"H Ono","year":"2020","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic logical computations using private operations. New Gener. Comput. 39(1), 19\u201340 (2020). https:\/\/doi.org\/10.1007\/s00354-020-00113-z","journal-title":"New Gener. Comput."},{"key":"9_CR39","unstructured":"Pass, R., Shelat, A.: A course in cryptography (2010). http:\/\/www.cs.cornell.edu\/~rafael\/"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00354-022-00155-5","volume":"40","author":"L Robert","year":"2022","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Card-based ZKP for connectivity: applications to Nurikabe, Hitori, and Heyawake. New Gener. Comput. 40, 149\u2013171 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00155-5","journal-title":"New Gener. Comput."},{"key":"9_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2021.104858","volume":"285","author":"L Robert","year":"2022","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Libralesso, L., Mizuki, T.: Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle. Inf. Comput. 285, 1\u201314 (2022). https:\/\/doi.org\/10.1016\/j.ic.2021.104858","journal-title":"Inf. Comput."},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Ruangwises, S.: Two standard decks of playing cards are sufficient for a ZKP for Sudoku. New Gener. Comput. 40, 49\u201365 (2022). https:\/\/doi.org\/10.1007\/s00354-021-00146-y","DOI":"10.1007\/s00354-021-00146-y"},{"issue":"1","key":"9_CR43","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00354-020-00114-y","volume":"39","author":"S Ruangwises","year":"2020","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Numberlink puzzle and k vertex-disjoint paths problem. New Gener. Comput. 39(1), 3\u201317 (2020). https:\/\/doi.org\/10.1007\/s00354-020-00114-y","journal-title":"New Gener. Comput."},{"key":"9_CR44","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2021.09.034","volume":"895","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Ripple Effect. Theor. Comput. Sci. 895, 115\u2013123 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.09.034","journal-title":"Theor. Comput. Sci."},{"key":"9_CR45","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). https:\/\/doi.org\/10.1016\/j.tcs.2020.05.036","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR46","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00354-020-00117-9","volume":"39","author":"K Shinagawa","year":"2021","unstructured":"Shinagawa, K.: Card-based cryptography with dihedral symmetry. New Gener. Comput. 39(1), 41\u201371 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00117-9","journal-title":"New Gener. Comput."},{"key":"9_CR47","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. Discret. Appl. Math. 289, 248\u2013261 (2021). https:\/\/doi.org\/10.1016\/j.dam.2020.10.013","journal-title":"Discret. Appl. Math."},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Takashima, K., Miyahara, D., Mizuki, T., Sone, H.: Actively revealing card attack on card-based protocols. Nat. Comput., 1\u201313 (2021, in press). https:\/\/doi.org\/10.1007\/s11047-020-09838-8","DOI":"10.1007\/s11047-020-09838-8"},{"issue":"4","key":"9_CR49","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10207-019-00463-w","volume":"19","author":"I Ueda","year":"2019","unstructured":"Ueda, I., Miyahara, D., Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: Secure implementations of a random bisection cut. Int. J. Inf. Secur. 19(4), 445\u2013452 (2019). https:\/\/doi.org\/10.1007\/s10207-019-00463-w","journal-title":"Int. J. Inf. Secur."},{"key":"9_CR50","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations. In: Foundations of Computer Science, pp. 160\u2013164. IEEE Computer Society, Washington, DC (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.88","DOI":"10.1109\/SFCS.1982.88"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:51:02Z","timestamp":1672552262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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","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":"3","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)"}}]}}