{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:13Z","timestamp":1772893033790,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T00:00:00Z","timestamp":1385078400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10207-013-0219-4","type":"journal-article","created":{"date-parts":[[2013,11,20]],"date-time":"2013-11-20T22:16:51Z","timestamp":1384985811000},"page":"15-23","source":"Crossref","is-referenced-by-count":97,"title":["A formalization of card-based cryptographic protocols via abstract machine"],"prefix":"10.1007","volume":"13","author":[{"given":"Takaaki","family":"Mizuki","sequence":"first","affiliation":[]},{"given":"Hiroki","family":"Shizuya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,22]]},"reference":[{"key":"219_CR1","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 306, 69\u201384 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"219_CR2","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Proceedings of the CRYPTO \u201993, Lecture Notes in Computer Science, vol. 773, pp. 319\u2013330, Springer, Berlin (1994)","DOI":"10.1007\/3-540-48329-2_27"},{"key":"219_CR3","doi-asserted-by":"crossref","unstructured":"den Boer, B.: More efficient match-making and satisfiability: the five card trick. In: Proceedings of the EUROCRYPT \u201989, Lecture Notes in Computer Science, vol. 434, pp. 208\u2013217, Springer, Berlin (1990)","DOI":"10.1007\/3-540-46885-4_23"},{"issue":"5","key":"219_CR4","doi-asserted-by":"crossref","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)","journal-title":"Commun. ACM"},{"issue":"2","key":"219_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s001459900004","volume":"9","author":"MJ Fischer","year":"1996","unstructured":"Fischer, M.J., Wright, R.N.: Bounds on secret key exchange using a random deal of cards. J. Cryptol. 9(2), 71\u201399 (1996)","journal-title":"J. Cryptol."},{"key":"219_CR6","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Asiedu, I.K., Sone, H.: Voting with a logarithmic number of cards. In: Proceedings of the UCNC 2013, Lecture Notes in Computer Science, vol. 7956, pp. 162\u2013173. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-39074-6_16"},{"key":"219_CR7","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Kumamoto, M., Sone, H.: The five-card trick can be done with four cards. In: Proceedings of the ASIACRYPT 2012, Lecture Notes in Computer Science, vol. 7658, pp. 598\u2013606. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-34961-4_36"},{"key":"219_CR8","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Proceedings of the Frontiers in Algorithmics (FAW 2009), Lecture Notes in Computer Science, vol. 5598, pp. 358\u2013369, Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02270-8_36"},{"key":"219_CR9","first-page":"279","volume":"36","author":"T Mizuki","year":"2006","unstructured":"Mizuki, T., Uchiike, F., Sone, H.: Securely computing XOR with 10 cards. Australas. J. Comb. 36, 279\u2013293 (2006)","journal-title":"Australas. J. Comb."},{"key":"219_CR10","doi-asserted-by":"crossref","unstructured":"Moran, T., Naor, M.: Polling with physical envelopes: a rigorous analysis of a human-centric protocol. In: Proceedings of the EUROCRYPT 2006, Lecture Notes in Computer Science, vol. 4004, pp. 88\u2013108. Springer, Berlin (2006)","DOI":"10.1007\/11761679_7"},{"key":"219_CR11","doi-asserted-by":"crossref","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, 173\u2013183 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"219_CR12","unstructured":"Stamer, H.: Efficient electronic gambling: an extended implementation of the toolbox for mental card games. In: Proceedings of the Western European Workshop on Research in Cryptology (WEWoRC 2005), Lecture Notes in Informatics,vol. P-74, pp. 1\u201312 (2005)"},{"key":"219_CR13","doi-asserted-by":"crossref","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, 671\u2013678 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"219_CR14","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42, 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-013-0219-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-013-0219-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-013-0219-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T17:26:24Z","timestamp":1564853184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-013-0219-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,22]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["219"],"URL":"https:\/\/doi.org\/10.1007\/s10207-013-0219-4","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,22]]}}}