{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:58:15Z","timestamp":1772276295594,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440505","type":"print"},{"value":"9783540457084","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45708-9_12","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:48:16Z","timestamp":1192783696000},"page":"178-193","source":"Crossref","is-referenced-by-count":58,"title":["On 2-Round Secure Multiparty Computation"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8th ACM PODC, pages 201\u2013209. ACM, 1989.","DOI":"10.1145\/72981.72995"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45539-6_23","volume-title":"Eurocrypt\u2019 00","author":"D. Beaver","year":"2000","unstructured":"D. Beaver. Minimal-Latency Secure Function Evaluation. In Eurocrypt\u2019 00, pages 335\u2013350, 2000. LNCS No. 1807."},{"key":"12_CR3","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In Proc. of CRYPTO\u2019 90."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. 22nd STOC, pages 503\u2013513. ACM, 1990.","DOI":"10.1145\/100216.100287"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. Proc. 20th STOC88, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"12_CR6","unstructured":"M. Ben-Or and N. Linial. Collective Coin-Flipping. In Randomness and Computation, pages 91\u2013115, 1990."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"P. Berman, J. Garay, and K. Perry. Bit Optimal Distributed Consensus. In R. Yaeza-Bates and U. Manber, editors, Computer Science Research, pages 313\u2013322. Plenum Publishing Corporation, 1992.","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In Proceedings of ICALP\u201900, 2000.","DOI":"10.1007\/3-540-45022-X_43"},{"issue":"1","key":"12_CR9","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 multiparty cryptographic protocols. Journal of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. 20th STOC88, pages 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"R. Cramer and I. Damg\u00f8ard. Secure distributed linear algebra in a constant number of rounds. In Proc. Crypto 2001.","DOI":"10.1007\/3-540-44647-8_7"},{"key":"12_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Eurocrypt\u2019 99","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damg\u00f8ard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Eurocrypt\u2019 99, pages 311\u2013326, 1999. LNCS No. 1592."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Uri Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In Proc. 26th STOC, pages 554\u2013563. ACM, 1994.","DOI":"10.1145\/195058.195408"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. SIAM. J. Computing, 26(2):873\u2013933, 1997.","journal-title":"SIAM. J. Computing"},{"key":"12_CR15","unstructured":"F. Gavril. Manuscript, 1974."},{"key":"12_CR16","unstructured":"R. Gennaro, S. Halevi, and T. Rabin. Round-optimal zero knowledge with distributed verifiers. http:\/\/www.research.ibm.com\/security , 2002."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proc. 33th STOC. ACM, 2001.","DOI":"10.1145\/380752.380853"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro. Achieving Independence Efficiently and Securely. In Proc. 14th ACM PODC, pages 130\u2013136. ACM, 1995.","DOI":"10.1145\/224964.224979"},{"key":"12_CR19","unstructured":"O. Goldreich. Secure multi-party computation (manuscript). http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html , 1998."},{"key":"12_CR20","unstructured":"O. Goldreich. Foundation of Cryptography \u2014 Fragments of a Book. ECCC 1995. Available online from http:\/\/www.eccc.uni-trier.de\/eccc\/ ."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proc. 19th STOC, pages 218\u2013229. ACM, 1987.","DOI":"10.1145\/28395.28420"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Private simultaneous messages protocols with applications. In ISTCS97, pages 174\u2013184, 1997.","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st FOCS, 2000.","DOI":"10.1109\/SFCS.2000.892118"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. In Proc. ICALP\u2019 02.","DOI":"10.1007\/3-540-45465-9_22"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. Lamport, R.E. Shostack, and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. and Systems, 4(3):382\u2013401, 1982.","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"key":"12_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Crypto\u2019 01","author":"Y. Lindell","year":"2001","unstructured":"Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In Crypto\u2019 01, pages 171\u2013189, 2001. LNCS No. 2139."},{"key":"12_CR27","unstructured":"N. Lynch. Distributed Algorithms. Morgan Kaufman, 1996."},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. 10th ACM PODC, pages 51\u201359. ACM, 1991.","DOI":"10.1145\/112600.112605"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM, 27(2):228\u2013234, 1980.","journal-title":"Journal of the ACM"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. 21st STOC, pages 73\u201385. ACM, 1989.","DOI":"10.1145\/73007.73014"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"T. Sander, A. Young, and M. Yung. Non-Interactive CryptoComputing For NC1. In Proc. 40th FOCS, pages 554\u2013567. IEEE, 1999.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"A. C-C. Yao. How to Generate and Exchange Secrets. In Proc. 27th FOCS, pages 162\u2013167. IEEE, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45708-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T19:12:19Z","timestamp":1737486739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45708-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440505","9783540457084"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-45708-9_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}