{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:12:36Z","timestamp":1769829156484,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725039","type":"print"},{"value":"9783540725046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_45","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"499-510","source":"Crossref","is-referenced-by-count":10,"title":["Secure Multiparty Computations Using a Dial Lock"],"prefix":"10.1007","author":[{"given":"Takaaki","family":"Mizuki","sequence":"first","affiliation":[]},{"given":"Yoshinori","family":"Kugimoto","sequence":"additional","affiliation":[]},{"given":"Hideaki","family":"Sone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","first-page":"33","volume":"33","author":"M.H. Albert","year":"2005","unstructured":"Albert, M.H., et al.: Safe communication for card players by combinatorial designs for two-step protocols. Australasian Journal of Combinatorics\u00a033, 33\u201346 (2005)","journal-title":"Australasian Journal of Combinatorics"},{"key":"45_CR2","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., et al.: Private computation using a PEZ dispenser. Theoretical Computer Science\u00a0306, 69\u201384 (2003)","journal-title":"Theoretical Computer Science"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"45_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04943-3","volume-title":"Boolean Functions and Computation Models","author":"P. Clote","year":"2002","unstructured":"Clote, P., Kranakis, E.: Boolean Functions and Computation Models. Springer, Heidelberg (2002)"},{"key":"45_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"45_CR6","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":"45_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s001459900004","volume":"9","author":"M.J. Fischer","year":"1996","unstructured":"Fischer, M.J., Wright, R.N.: Bounds on secret key exchange using a random deal of cards. Journal of Cryptology\u00a09, 71\u201399 (1996)","journal-title":"Journal of Cryptology"},{"key":"45_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography II: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography II: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/11750321_52","volume-title":"Theory and Applications of Models of Computation","author":"T. Mizuki","year":"2006","unstructured":"Mizuki, T., Otagiri, T., Sone, H.: Secure computations in a minimal model using multiple-valued ESOP expressions. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 547\u2013554. Springer, Heidelberg (2006)"},{"issue":"1","key":"45_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0166-218X(02)00426-2","volume":"131","author":"T. Mizuki","year":"2003","unstructured":"Mizuki, T., Shizuya, H., Nishizeki, T.: Characterization of optimal key set protocols. Discrete Applied Mathematics\u00a0131(1), 213\u2013236 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/11523468_24","volume-title":"Automata, Languages and Programming","author":"T. Moran","year":"2005","unstructured":"Moran, T., Naor, M.: Basing cryptographic protocols on tamper-evident seals. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 285\u2013297. Springer, Heidelberg (2005)"},{"key":"45_CR12","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)"},{"key":"45_CR13","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, 173\u2013183 (1998)","journal-title":"Theoretical Computer Science"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-48321-7_3","volume-title":"Fundamentals of Computation Theory","author":"A. Salomaa","year":"1999","unstructured":"Salomaa, A.: Caesar and DNA. Views on cryptology. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 39\u201353. Springer, Heidelberg (1999)"},{"key":"45_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03269-5","volume-title":"Public-Key Cryptography","author":"A. Salomaa","year":"1996","unstructured":"Salomaa, A.: Public-Key Cryptography, 2nd Enlarged edn. Springer, New York (1996)","edition":"2"},{"key":"45_CR16","doi-asserted-by":"crossref","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. Kluwer Academic Publishers, Boston (1999)"},{"key":"45_CR17","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, 671\u2013678 (2001)","journal-title":"Theoretical Computer Science"},{"key":"45_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity","author":"H. Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:38:16Z","timestamp":1619501896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_45","relation":{},"subject":[]}}