{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:50:06Z","timestamp":1756000206167,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030184186"},{"type":"electronic","value":"9783030184193"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18419-3_13","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:20Z","timestamp":1556753120000},"page":"193-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Card-Based Cryptographic Protocols with the Minimum Number of Cards Using Private Operations"],"prefix":"10.1007","author":[{"given":"Hibiki","family":"Ono","sequence":"first","affiliation":[]},{"given":"Yoshifumi","family":"Manabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,14]]},"reference":[{"key":"13_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 5th ACM International Workshop on Asia Public-Key Cryptography (APKC 2018), pp. 3\u20138 (2018)","DOI":"10.1145\/3197507.3197510"},{"key":"13_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 den","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":"13_CR3","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":"13_CR4","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":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-72089-0_8","volume-title":"Information Theoretic Security","author":"Y Hashimoto","year":"2017","unstructured":"Hashimoto, Y., Shinagawa, K., Nuida, K., Inamura, M., Hanaoka, G.: Secure grouping protocol using a deck of cards. In: Shikata, J. (ed.) ICITS 2017. LNCS, vol. 10681, pp. 135\u2013152. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72089-0_8"},{"key":"13_CR6","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":"13_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":"13_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, Part III. LNCS, vol. 10626, pp. 126\u2013155. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_5"},{"key":"13_CR9","unstructured":"Koch, A.: The landscape of optimal card-based protocols. IACR Cryptology ePrint Archive, Report 2018\/951 (2018)"},{"key":"13_CR10","unstructured":"Koch, A., Walzer, S.: Foundations for actively secure card-based cryptography. Cryptology ePrint Archive, Report 2017\/423 (2017)"},{"key":"13_CR11","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":"13_CR12","unstructured":"Kurosawa, K., Shinozaki, T.: Compact card protocol. In: Proceedings of SCIS 2017. pp. 1A2\u20136 (2017). (in Japanese)"},{"key":"13_CR13","unstructured":"Marcedone, A., Wen, Z., Shi, E.: Secure dating with four or fewer cards. IACR Cryptology ePrint Archive, Report 2015\/1031 (2015)"},{"key":"13_CR14","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":"13_CR15","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":"13_CR16","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":"13_CR17","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. Fundam. Electron. Commun. Comput. Sci. 100(1), 3\u201311 (2017)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"13_CR18","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":"13_CR19","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"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-319-48965-0_30","volume-title":"Cryptology and Network Security","author":"T Nakai","year":"2016","unstructured":"Nakai, T., Tokushige, Y., Misawa, Y., Iwamoto, M., Ohta, K.: Efficient card-based cryptographic protocols for millionaires\u2019 problem utilizing private permutations. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 500\u2013517. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_30"},{"issue":"1","key":"13_CR21","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":"13_CR22","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":"13_CR23","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. Fundam. Electron. Commun. Comput. Sci. 98(6), 1145\u20131152 (2015)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-45008-2_16","volume-title":"Theory and Practice of Natural Computing","author":"T Nishida","year":"2013","unstructured":"Nishida, T., Mizuki, T., Sone, H.: Securely computing the three-input majority function with eight cards. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B., Vega-Rodr\u00edguez, M.A. (eds.) TPNC 2013. LNCS, vol. 8273, pp. 193\u2013204. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45008-2_16"},{"issue":"2","key":"13_CR25","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":"13_CR26","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":"13_CR27","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: And protocols using only uniform shuffles. arXiv preprint arXiv:1810.00769 (2018)","DOI":"10.1007\/978-3-030-19955-5_30"},{"key":"13_CR28","unstructured":"Shirouchi, S., Nakai, T., Iwamoto, M., Ohta, K.: Efficient card-based cryptographic protocols for logic gates utilizing private permutations. In: Proceedings of SCIS 2017, pp. 1A2\u20132 (2017). (in Japanese)"},{"issue":"1","key":"13_CR29","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":"13_CR30","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"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18419-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T07:24:05Z","timestamp":1663399445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18419-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030184186","9783030184193"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18419-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations and Practice of Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fps2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fps2018.encs.concordia.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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31% - 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"}},{"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"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}