{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:42:03Z","timestamp":1769920923727,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030895426","type":"print"},{"value":"9783030895433","type":"electronic"}],"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-89543-3_55","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"668-679","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Card-Minimal Three-Input AND\u00a0Protocol Using Two Shuffles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4326-1019","authenticated-orcid":false,"given":"Raimu","family":"Isuzugawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4586-4342","authenticated-orcid":false,"given":"Kodai","family":"Toyoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8539-3725","authenticated-orcid":false,"given":"Yu","family":"Sasaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5818-8937","authenticated-orcid":false,"given":"Daiki","family":"Miyahara","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"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Abe, Y., Hayashi, Y., Mizuki, T., Sone, H.: Five-card AND computations in committed format using only uniform cyclic shuffles. New Gener. Comput. 39(1), 97\u2013114 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00110-2","DOI":"10.1007\/s00354-020-00110-2"},{"key":"55_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":"55_CR3","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":"55_CR4","unstructured":"Koch, A.: The landscape of optimal card-based protocols. Cryptology ePrint Archive, Report 2018\/951 (2018). https:\/\/eprint.iacr.org\/2018\/951"},{"key":"55_CR5","unstructured":"Koch, A.: Cryptographic protocols from physical assumptions. Ph.D. thesis, Karlsruhe Institute of Technology (2019). https:\/\/doi.org\/10.5445\/IR\/1000097756"},{"key":"55_CR6","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"},{"key":"55_CR7","doi-asserted-by":"crossref","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","DOI":"10.1007\/s00354-020-00120-0"},{"key":"55_CR8","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":"55_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-030-79987-8_33","volume-title":"Combinatorial Algorithms","author":"Y Manabe","year":"2021","unstructured":"Manabe, Y., Ono, H.: Card-based cryptographic protocols for three-input functions using private operations. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 469\u2013484. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_33"},{"issue":"5","key":"55_CR10","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10207-020-00525-4","volume":"20","author":"D Miyahara","year":"2021","unstructured":"Miyahara, D., Ueda, I., Hayashi, Y., Mizuki, T., Sone, H.: Evaluating card-based protocols in terms of execution time. Int. J. Inf. Secur. 20(5), 729\u2013740 (2021). https:\/\/doi.org\/10.1007\/s10207-020-00525-4","journal-title":"Int. J. Inf. Secur."},{"key":"55_CR11","doi-asserted-by":"crossref","unstructured":"Mizuki, T.: Card-based protocols for securely computing the conjunction of multiple variables. Theor. Comput. Sci. 622(C), 34\u201344 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.01.039","DOI":"10.1016\/j.tcs.2016.01.039"},{"key":"55_CR12","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":"55_CR13","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). https:\/\/doi.org\/10.1007\/s10207-013-0219-4","journal-title":"Int. J. Inf. Secur."},{"key":"55_CR14","doi-asserted-by":"crossref","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":"55_CR15","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":"55_CR16","doi-asserted-by":"crossref","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","DOI":"10.1007\/s00354-020-00118-8"},{"key":"55_CR17","doi-asserted-by":"publisher","unstructured":"Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: An implementation of non-uniform shuffle for secure multi-party computation. In: Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, AsiaPKC 2016, pp. 49\u201355. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2898420.2898425,https:\/\/doi.acm.org\/10.1145\/2898420.2898425","DOI":"10.1145\/2898420.2898425,"},{"issue":"2","key":"55_CR18","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). https:\/\/doi.org\/10.1007\/s00500-017-2858-2","journal-title":"Soft Comput."},{"key":"55_CR19","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Efficient card-based cryptographic protocols for the millionaires\u2019 problem using private input operations. In: Asia Joint Conference on Information Security (AsiaJCIS), pp. 23\u201328 (2018). https:\/\/doi.org\/10.1109\/AsiaJCIS.2018.00013","DOI":"10.1109\/AsiaJCIS.2018.00013"},{"key":"55_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-030-18419-3_13","volume-title":"Foundations and Practice of Security","author":"H Ono","year":"2019","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.) FPS 2018. LNCS, vol. 11358, pp. 193\u2013207. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18419-3_13"},{"key":"55_CR21","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"},{"key":"55_CR22","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic logical computations using private operations. New Gener. Comput. 39(1), 19\u201340 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00113-z","DOI":"10.1007\/s00354-020-00113-z"},{"key":"55_CR23","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":"55_CR24","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Securely computing the n-variable equality function with 2n cards. Theor. Comput. Sci. (2021, in press). https:\/\/doi.org\/10.1016\/j.tcs.2021.07.007","DOI":"10.1016\/j.tcs.2021.07.007"},{"key":"55_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-63000-3_9","volume-title":"Theory and Practice of Natural Computing","author":"T Saito","year":"2020","unstructured":"Saito, T., Miyahara, D., Abe, Y., Mizuki, T., Shizuya, H.: How to implement a non-uniform or non-closed shuffle. In: Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A., Yang, M.-S. (eds.) TPNC 2020. LNCS, vol. 12494, pp. 107\u2013118. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63000-3_9"},{"issue":"4","key":"55_CR26","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, Y., 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":"55_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-49001-4_5","volume-title":"Theory and Practice of Natural Computing","author":"I Ueda","year":"2016","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.) TPNC 2016. LNCS, vol. 10071, pp. 58\u201369. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49001-4_5"},{"key":"55_CR28","doi-asserted-by":"crossref","unstructured":"Yasunaga, K.: Practical card-based protocol for three-input majority. IEICE Trans. Fundam. 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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:21:38Z","timestamp":1634782898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"131","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":"56","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":"43% - 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":"2.2","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)"}}]}}