{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:09:16Z","timestamp":1778789356457,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551881","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_34","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"420-432","source":"Crossref","is-referenced-by-count":556,"title":["Efficient Multiparty Protocols Using Circuit Randomization"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan, D. Beaver. \u201cNon-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction.\u201d Proceedings of PODC, ACM, 1989, 201\u2013209.","DOI":"10.1145\/72981.72995"},{"key":"34_CR2","unstructured":"D. Beaver. \u201cSecure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority.\u201d To appear, J. Cryptology. An earlier version appeared as \u201cSecure Multiparty Protocols Tolerating Half Faulty Processors.\u201d Proceedings of Crypto 1989, ACM, 1989."},{"key":"34_CR3","volume-title":"Security, Fault Tolerance, and Communication Complexity in Distributed Systems","author":"D. Beaver","year":"1990","unstructured":"D. Beaver. Security, Fault Tolerance, and Communication Complexity in Distributed Systems. PhD Thesis, Harvard University, Cambridge, 1990."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Goldwasser. \u201cMultiparty Computation with Faulty Majority.\u201d Proceedings of the 30th FOCS, IEEE, 1989, 468\u2013473.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"34_CR5","unstructured":"D. Beaver, S. Haber. \u201cCryptographic Protocols Provably Secure Against Dynamic Adversaries.\u201d Submitted to FOCS 91."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway. \u201cThe Round Complexity of Secure Protocols.\u201d Proceedings of the 22st STOC, ACM, 1990, 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson. \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.\u201d Proceedings of the 20th STOC, ACM, 1988, 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd. \u201cMultiparty Unconditionally Secure Protocols.\u201d Proceedings of the 20th STOC, ACM, 1988, 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Z. Galil, S. Haber, M. Yung. \u201cCryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model.\u201d Proceedings of Crypto 1987, Springer-Verlag, 1988, 135\u2013155.","DOI":"10.1007\/3-540-48184-2_10"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson. \u201cProofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design.\u201d Proceedings of the 27th FOCS, IEEE, 1986, 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson. \u201cHow to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority.\u201d Proceedings of the 19th STOC, ACM, 1987, 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"34_CR12","unstructured":"S. Goldwasser, L. Levin. \u201cFair Computation of General Functions in Presence of Immoral Majority.\u201d Proceedings of Crypto 1990."},{"key":"34_CR13","unstructured":"S. Haber. Multi-Party Cryptographic Computation: Techniques and Applications, PhD Thesis, Columbia University, 1988."},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"T. Rabin, M. Ben-Or. \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority.\u201d Proceedings of the 21st STOC, ACM, 1989, 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. \u201cHow to Share a Secret.\u201d Communications of the ACM, 22 (1979), 612\u2013613.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:33Z","timestamp":1605647613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_34","relation":{},"subject":[]}}