{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:07:06Z","timestamp":1776942426631,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_31","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"377-391","source":"Crossref","is-referenced-by-count":102,"title":["Foundations of Secure Interactive Computing"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, J. Feigenbaum, J. Kilian. \u201cOn Hiding Information from an Oracle.\u201d J. Comput. System Sci. 39 (1989), 21\u201350.","journal-title":"J. Comput. System Sci."},{"key":"31_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":"31_CR3","unstructured":"D. Beaver. \u201cFormal Definitions for Secure Distributed Protocols.\u201d Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.)."},{"key":"31_CR4","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":"31_CR5","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Goldwasser. \u201cMultiparty Computation with Faulty Majority.\u201d Proceedings of the 30 th FOCS, IEEE, 1989, 468\u2013473.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"31_CR6","unstructured":"D. Beaver, S. Haber. \u201cCryptographic Protocols Provably Secure Against Dynamic Adversaries.\u201d Submitted to FOCS 91."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway. \u201cThe Round Complexity of Secure Protocols.\u201d Proceedings of the 22 st STOC, ACM, 1990, 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"31_CR8","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":"31_CR9","first-page":"79","volume-title":"Proceedings of the 1980 Symposium on Security and Privacy","author":"R. Blakley","year":"1981","unstructured":"R. Blakley. \u201cSecurity Proofs for Information Protection Systems.\u201d Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society Press, New York, 1981, 79\u201388."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau. \u201cMinimum Disclosure Proofs of Knowledge.\u201d J. Comput. System Sci. 37 (1988), 156\u2013189.","journal-title":"J. Comput. System Sci."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd. \u201cMultiparty Unconditionally Secure Protocols.\u201d Proceedings of the 20 th STOC, ACM, 1988, 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"31_CR12","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"},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1137\/0218049","volume":"18","author":"Z. Galil","year":"1989","unstructured":"Z. Galil, S. Haber, and M. Yung. \u201cMinimum-Knowledge Interactive Proofs for Decision Problems.\u201d SIAM J. Comput. 18:4 (1989), 711\u2013739.","journal-title":"SIAM J. Comput."},{"key":"31_CR14","unstructured":"S. Goldwasser, L. Levin. \u201cFair Computation of General Functions in Presence of Immoral Majority.\u201d Proceedings of Crypto 1990."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali. \u201cProbabilistic Encryption.\u201d J. Comput. System Sci. 28 (1984), 270\u2013299.","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff. \u201cThe Knowledge Complexity of Interactive Proof Systems.\u201d SIAM J. Comput. 18:1 (1989), 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, M. Sipser. \u201cPrivate Coins vs. Public Coins in Interactive Proof Systems.\u201d Proceedings of the 18th STOC, ACM, 1986, 59\u201368.","DOI":"10.1145\/12130.12137"},{"key":"31_CR18","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":"31_CR19","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":"31_CR20","unstructured":"S. Haber. Multi-Party Cryptographic Computation: Techniques and Applications, PhD Thesis, Columbia University, 1988."},{"key":"31_CR21","unstructured":"S. Micali, P. Rogaway. \u201cThe Notion of Secure Computation.\u201d Unpublished Manuscript, 1990."},{"key":"31_CR22","unstructured":"S. Micali, P. Rogaway. \u201cSecure Computation.\u201d These Proceedings (Crypto 1991), page 9.8."},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Y. Oren. \u201cOn the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs.\u201d Proceedings of the 19th STOC, ACM, 1987, 462\u2013471.","DOI":"10.1109\/SFCS.1987.43"},{"key":"31_CR24","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":"31_CR25","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"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cTheory and Applications of Trapdoor Functions.\u201d Proceedings of the 23rd FOCS, IEEE, 1982, 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"A. Yao. \u201cHow to Generate and Exchange Secrets.\u201d Proceedings of the 27th FOCS, IEEE, 1986, 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"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_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:48:43Z","timestamp":1619570923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_31","relation":{},"subject":[]}}