{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T16:11:27Z","timestamp":1772122287389,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450075","type":"print"},{"value":"9783642450082","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45008-2_16","type":"book-chapter","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T21:12:40Z","timestamp":1385586760000},"page":"193-204","source":"Crossref","is-referenced-by-count":37,"title":["Securely Computing the Three-Input Majority Function with Eight Cards"],"prefix":"10.1007","author":[{"given":"Takuya","family":"Nishida","sequence":"first","affiliation":[]},{"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[]},{"given":"Hideaki","family":"Sone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\u20133","key":"16_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(03)00210-X","volume":"306","author":"J. Balogh","year":"2003","unstructured":"Balogh, J., Csirik, J.A., Ishai, Y., Kushilevitz, E.: Private computation using a PEZ dispenser. Theoretical Computer Science\u00a0306(1\u20133), 69\u201384 (2003)","journal-title":"Theoretical Computer Science"},{"key":"16_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 - 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.\u00a0434, pp. 208\u2013217. Springer, Heidelberg (1990)"},{"key":"16_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 - CRYPTO \u201993","author":"C. Cr\u00e9peau","year":"1994","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 319\u2013330. Springer, Heidelberg (1994)"},{"issue":"5","key":"16_CR4","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. Communications of the ACM\u00a039(5), 77\u201385 (1996)","journal-title":"Communications of the ACM"},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Volume 2, Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, New York (2004)"},{"key":"16_CR6","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.\u00a07956, pp. 162\u2013173. Springer, Heidelberg (2013)"},{"key":"16_CR7","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.\u00a07658, pp. 598\u2013606. Springer, Heidelberg (2012)"},{"key":"16_CR8","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.\u00a05598, pp. 358\u2013369. Springer, Heidelberg (2009)"},{"key":"16_CR9","first-page":"279","volume":"36","author":"T. Mizuki","year":"2006","unstructured":"Mizuki, T., Uchiike, F., Sone, H.: Securely computing XOR with 10 cards. The Australasian Journal of Combinatorics\u00a036, 279\u2013293 (2006)","journal-title":"The Australasian Journal of Combinatorics"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11761679_7","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"T. Moran","year":"2006","unstructured":"Moran, T., Naor, M.: Polling with physical envelopes: A rigorous analysis of a human-centric protocol. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 88\u2013108. Springer, Heidelberg (2006)"},{"issue":"1\u20132","key":"16_CR11","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. Theoretical Computer Science\u00a0191(1\u20132), 173\u2013183 (1998)","journal-title":"Theoretical Computer Science"},{"key":"16_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5139-3","volume-title":"Switching Theory for Logic Synthesis","author":"T. Sasao","year":"1999","unstructured":"Sasao, T.: Switching Theory for Logic Synthesis, 1st edn. Kluwer Academic Publishers, Norwell (1999)","edition":"1"},{"key":"16_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30042-4","volume-title":"Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation","author":"T. Schneider","year":"2012","unstructured":"Schneider, T.: Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"16_CR14","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. Theoretical Computer Science\u00a0259(1-2), 671\u2013678 (2001)","journal-title":"Theoretical Computer Science"},{"key":"16_CR15","first-page":"160","volume-title":"Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, FOCS 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, FOCS 1982, pp. 160\u2013164. IEEE Computer Society, Washington, DC (1982)"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45008-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T18:09:51Z","timestamp":1558721391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45008-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450075","9783642450082"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45008-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}