{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:07:36Z","timestamp":1776938856285,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540564133","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_26","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T19:23:49Z","timestamp":1186601029000},"page":"307-323","source":"Crossref","is-referenced-by-count":59,"title":["Cryptographic Protocols Provably Secure Against Dynamic Adversaries"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]},{"given":"Stuart","family":"Haber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"L. Babai, S. Moran. \u201cArthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes.\u201d J. Comput. System Sci. 36 (1988), 254\u2013276.","journal-title":"J. Comput. System Sci."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"J. Bar-Han, 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"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"D. Beaver. \u201cSecure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority.\u201d J. Cryptology. 4:2, 1991, 75\u2013122. An earlier version appeared as \u201cSecure Multiparty Protocols Tolerating Half Faulty Processors\u201d in CRYPTO\u2019 89, G. Brassard, ed., Springer-Verlag LNCS 435, 1990.","journal-title":"J. Cryptology"},{"key":"26_CR4","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":"26_CR5","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. Ph.D. Thesis, Harvard University, Cambridge, 1990."},{"key":"26_CR6","unstructured":"D. Beaver. \u201cFoundations of Secure Interactive Computation.\u201d Proceedings of Crypto\u2019 91 (to appear)."},{"key":"26_CR7","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":"26_CR8","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway. \u201cThe Round Complexity of Secure Protocols.\u201d Proceedings of the 22nd STOC, ACM, 1990, 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"26_CR9","unstructured":"M. Bellare and O. Goldreich. \u201cOn Defining Proofs of Knowledge.\u201d Proceedings of Crypto\u2019 92 (to appear)."},{"key":"26_CR10","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":"26_CR11","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":"26_CR12","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":"26_CR13","doi-asserted-by":"crossref","unstructured":"B. Chor, M. Rabin. \u201cAchieving Independence in a Logarithmic Number of Rounds.\u201d Proceedings of the 6th PODC, ACM, 1987.","DOI":"10.1145\/41840.41862"},{"issue":"2","key":"26_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir. \u201cZero knowledge proofs of identity.\u201d J. of Cryptology, 1:2, 1988, 77\u201394.","journal-title":"J. of Cryptology"},{"key":"26_CR15","unstructured":"P. Feldman. \u201cOne Can Always Assume Private Channels.\u201d Unpublished manuscript, 1988."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"P. Feldman, S. Micali. \u201cOptimal Algorithms for Byzantine Agreement.\u201d Proceedings of the 20th STOC, ACM, 1988, 148\u2013161. (The reader of this paper is referred for the relevant result to Feldman\u2019s Ph.D. Thesis, Optimal Algorithms for Byzantine Agreement (MIT, 1988), where it apparently does not appear; but see [15].)","DOI":"10.1145\/62212.62225"},{"key":"26_CR17","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":"26_CR18","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":"26_CR19","unstructured":"Z. Galil, S. Haber, and M. Yung. \u201cInteractive public-key cryptosystems.\u201d Submitted for publication, 1991."},{"key":"26_CR20","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":"26_CR21","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":"26_CR22","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":"26_CR23","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":"26_CR24","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":"26_CR25","unstructured":"S. Goldwasser, L. Levin. \u201cFair Computation of General Functions in Presence of Immoral Majority.\u201d Proceedings of Crypto 1990."},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad. \u201cPseudo-Random Generators under Uniform Assumptions.\u201d Proceedings of the 22nd STOC, ACM, 1990, 395\u2013404.","DOI":"10.1145\/100216.100270"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, and M. Luby. \u201cPseudorandom Generation from One-Way Functions.\u201d Proceedings of the 21st STOC, ACM, 1989, 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"26_CR28","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":"26_CR29","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":"26_CR30","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll. \u201cRandom self-reducibility and zero knowledge interactive proofs of possession of information.\u201d Proceedings of the 28th FOCS, IEEE, 1987, 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"},{"key":"26_CR31","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"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:58Z","timestamp":1605629638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_26","relation":{},"subject":[]}}