{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:35:00Z","timestamp":1787502900251,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_5","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T06:15:21Z","timestamp":1178000121000},"page":"74-92","source":"Crossref","is-referenced-by-count":33,"title":["Parallel Reducibility for Information-Theoretically Secure Computation"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"D. Beaver, Foundations of Secure Interactive Computing. Proc. of CRYPTO\u201991, pp. 377\u2013391, 1991.","DOI":"10.1007\/3-540-46766-1_31"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"D. Beaver, Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty majority. Journal of Cryptology, 4(2), pp. 75\u2013122, 1991.","journal-title":"Journal of Cryptology"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver and S. Goldwasser, Multi-party computation with faulty majority, Proc. of the 30th FOCS, pp. 468\u2013473, 1989.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. of the 20th STOC, pp. 1\u201310, 1998.","DOI":"10.1145\/62212.62213"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"R. Canetti, Security and Composition of Multi-party Cryptographic Protocols. Journal of Cryptology, 13(1):143\u2013202.","DOI":"10.1007\/s001459910006"},{"key":"5_CR6","unstructured":"R. Canetti, Studies in Secure Multi-party Computation and Application, Ph.D. Thesis, Weizmann Institute, Israel, 1995."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau and I. Damg\u00e5rd, Multiparty unconditionally secure protocols, Proc. of the 20th STOC, pp. 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"R. Cramer, U. Maurer, and I. Damg\u00e5rd, General secure multiparty computation from any linear secret-sharing scheme, Proc. EUROCRYPT\u201900, pp. 316\u2013334, 2000.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"5_CR9","unstructured":"Y. Dodis and S. Micali. Parallel Reducibility for Information-Theoretically Secure Computation. Manuscript in progress."},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"P. Feldman and S. Micali, Optimal algorithms for Byzantine agreement, SIAM J. on Computing, 26(4):873\u2013933, 1997.","journal-title":"SIAM J. on Computing"},{"key":"5_CR11","unstructured":"S. Goldwasser and L. Levin, Fair computation of general functions in presence of immoral majority, Proc. CRYPTO\u2019 90, pp. 75\u201384, 1990."},{"key":"5_CR12","unstructured":"O. Goldreich, Secure Multi-Party Computation, First draft available at http:\/\/theory.lcs.mit.edu\/oded ."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, Proc. of the 19th STOC, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"5_CR14","unstructured":"K. Kilian, E. Kushilevitz, S. Micali and R. Ostrovsky, Reducibility and Completeness in Private Computations, To appear in SIAM J. on Computing, preliminary versions in Proc. of the 23rd STOC, 1991 by Kilian and in Proc. of the 35th FOCS, 1994 by Kushilevitz, Micali and Ostrovsky."},{"key":"5_CR15","first-page":"392","volume-title":"Proc. CRYPTO\u2019 91","author":"S. Micali","year":"1991","unstructured":"S. Micali and P. Rogaway, Secure computation, Proc. CRYPTO\u2019 91, pp. 392\u2013404, 1991. Also in Workshop On Multi-Party Secure Computation, Weizmann Institute, Israel, 1998."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or, Verifiable Secret Sharing and Multi-party Protocols with Honest Majority, Proc. of 21st STOC, pp. 75\u201383, 1989.","DOI":"10.1145\/73007.73014"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"A. Yao, Protocols for secure computation, Proc. of the 23rd FOCS, pp. 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T19:06:25Z","timestamp":1736967985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}