{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T23:51:47Z","timestamp":1776210707579,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_10","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:28:14Z","timestamp":1194964094000},"page":"171-189","source":"Crossref","is-referenced-by-count":41,"title":["Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Lindell","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","first-page":"377","volume-title":"Crypto91","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. Foundations of Secure Interactive Computing. In Crypto91, Springer-Verlag LNCS Vol. 576, pages 377\u2013391, 1991."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali and P. Rogaway. The Round Complexity of Secure Protocols. In 22nd STOC, pages 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"10_CR3","unstructured":"M. Blum. Coin Flipping by Phone. IEEE Spring COMPCOM, pages 133\u2013137, February 1982."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(91)90259-5","volume":"84","author":"G. Brassard","year":"1991","unstructured":"G. Brassard, C. Crepeau and M. Yung. Constant-round perfect zero-knowledge computationally convincing protocols. In Theoretical Computer Science, Vol. 84(1), pp. 23\u201352, 1991.","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti. Security and Composition of Multi-party Cryptographic Protocols. Journal of Cryptology, Vol. 13, No. 1, pages 143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","first-page":"250","volume-title":"Crypto93","author":"I. Damgard","year":"1993","unstructured":"I. Damgard, T. Pederson and B. Pfitzmann. On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures. In Crypto93, Springer-Verlag LNCS Vol. 773, pages 250\u2013265, 1993."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. Communications of the A CM 28, pp. 637\u2013647, 1985.","journal-title":"Communications of the A CM"},{"key":"10_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Crypto89","author":"U. Feige","year":"1990","unstructured":"U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In Crypto89, Springer-Verlag LNCS Vol. 435, pp 526\u2013544."},{"key":"10_CR9","unstructured":"O. Goldreich. Secure Multi-Party Computation. Manuscript. Preliminary version, 1998. Available from: http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html ."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Foundations of Cryptography: Volume 1-Basic Tools. Cambridge University Press, 2001.","DOI":"10.1017\/CBO9780511546891"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing, Vol. 25, No. 1, February 1996, pages 169\u2013192.","journal-title":"SIAM Journal on Computing"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38, No. 1, pages 691\u2013729, 1991.","journal-title":"JACM"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game-A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218\u2013229, 1987. For details see [9].","DOI":"10.1145\/28395.28420"},{"key":"10_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Crypto\u201991","author":"S. Micali","year":"1991","unstructured":"S. Micali and P. Rogaway. Secure Computation. Unpublished manuscript, 1992. Preliminary version in Crypto\u201991, Springer-Verlag (LNCS 576), 1991."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"M. Naor. Bit Commitment using Pseudorandom Generators. Journal of Cryptology, Vol. 4, pages 151\u2013158, 1991.","journal-title":"Journal of Cryptology"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In 21st STOC, pages 33\u201343, 1989.","DOI":"10.1145\/73007.73011"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"A.C. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:22:07Z","timestamp":1556950927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}