{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:20:23Z","timestamp":1742930423245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_17","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"246-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Practical and Easy-to-Understand Card-Based Implementation of Yao\u2019s Millionaire Protocol"],"prefix":"10.1007","author":[{"given":"Daiki","family":"Miyahara","sequence":"first","affiliation":[]},{"given":"Yu-ichi","family":"Hayashi","sequence":"additional","affiliation":[]},{"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[]},{"given":"Hideaki","family":"Sone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"1-3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(03)00210-X","volume":"306","author":"J\u00f3zsef Balogh","year":"2003","unstructured":"Balogh, J., Csirik, J.A., Ishai, Y., Kushilevitz, E.: Private computation using a PEZ dispenser. Theor. Comput. Sci. 306(1), 69\u201384 (2003). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030439750300210X","journal-title":"Theoretical Computer Science"},{"key":"17_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"},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R Fagin","year":"1996","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Commun. ACM 39(5), 77\u201385 (1996). https:\/\/doi.org\/10.1145\/229459.229469","journal-title":"Commun. ACM"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-319-61273-7_24","volume-title":"Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology","author":"G Hanaoka","year":"2017","unstructured":"Hanaoka, G.: Towards user-friendly cryptography. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 481\u2013484. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_24"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-68697-5_15","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"M Jakobsson","year":"1996","unstructured":"Jakobsson, M., Yung, M.: Proving without knowing: on oblivious, agnostic and blindfolded provers. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 186\u2013200. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_15"},{"key":"17_CR6","unstructured":"Koch, A., Walzer, S.: Foundations for actively secure card-based cryptography. Cryptology ePrint Archive, Report 2017\/423 (2017). https:\/\/eprint.iacr.org\/2017\/423"},{"key":"17_CR7","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":"17_CR8","unstructured":"Marcedone, A., Wen, Z., Shi, E.: Secure dating with four or fewer cards. Cryptology ePrint Archive, Report 2015\/1031 (2015). https:\/\/eprint.iacr.org\/2015\/1031"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-73556-4_28","volume-title":"Combinatorial Optimization and Applications","author":"T Mizuki","year":"2007","unstructured":"Mizuki, T., Kugimoto, Y., Sone, H.: Secure multiparty computations using the 15 puzzle. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 255\u2013266. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73556-4_28"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10207-013-0219-4","volume":"13","author":"T Mizuki","year":"2014","unstructured":"Mizuki, T., Shizuya, H.: A formalization of card-based cryptographic protocols via abstract machine. Int. J. Inf. Secur. 13(1), 15\u201323 (2014)","journal-title":"Int. J. Inf. Secur."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-07890-8_27","volume-title":"Fun with Algorithms","author":"T Mizuki","year":"2014","unstructured":"Mizuki, T., Shizuya, H.: Practical card-based cryptography. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) Fun with Algorithms. Lecture Notes in Computer Science, vol. 8496, pp. 313\u2013324. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07890-8_27"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1587\/transfun.E100.A.3","volume":"E100.A","author":"Takaaki 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. E100.A(1), 3\u201311 (2017)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"17_CR13","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":"17_CR14","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":"17_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-319-48965-0_30","volume-title":"CANS 2016","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"},{"key":"17_CR16","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":"9","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1494","DOI":"10.1587\/transfun.E101.A.1494","volume":"E101.A","author":"Akihiro NISHIMURA","year":"2018","unstructured":"Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: Pile-shifting scramble for card-based protocols. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E101.A(9), 1494\u20131502 (2018)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-26841-5_9","volume-title":"Theory and Practice of Natural Computing","author":"A Nishimura","year":"2015","unstructured":"Nishimura, A., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Five-card secure computations using unequal division shuffle. In: Dediu, A.-H., Magdalena, L., Mart\u00edn-Vide, C. (eds.) TPNC 2015. LNCS, vol. 9477, pp. 109\u2013120. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26841-5_9"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00500-017-2858-2","volume":"22","author":"A Nishimura","year":"2017","unstructured":"Nishimura, A., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols using unequal division shuffles. Soft Comput. 22, 361\u2013371 (2017). https:\/\/doi.org\/10.1007\/s00500-017-2858-2","journal-title":"Soft Comput."},{"key":"17_CR20","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":"17_CR21","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. SFCS 1982. IEEE Computer Society, Washington, DC, USA (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.88","DOI":"10.1109\/SFCS.1982.88"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:48:19Z","timestamp":1710344899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}