{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:03Z","timestamp":1736084403424,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":148,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020424","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"53-73","source":"Crossref","is-referenced-by-count":0,"title":["Secure distributed computing: Theory and practice"],"prefix":"10.1007","author":[{"given":"Moti","family":"Yung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"5_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, and J. Kilian, \u201cOn hiding information from an oracle,\u201d J. Comput. System Sci. 39 (1989), 21\u201350.","journal-title":"J. Comput. System Sci."},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02252866","volume":"2","author":"M. Abadi","year":"1990","unstructured":"M. Abadi and J. Feigenbaum, \u201cSecure circuit evaluation: a protocol based on hiding information from an oracle,\u201d J. Cryptology 2 (1990), 1\u201312.","journal-title":"J. Cryptology"},{"key":"5_CR3","unstructured":"L. Adleman Abstract Theory of Computer Viruses CRYPTO 88."},{"key":"5_CR4","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 and 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":"5_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/S0019-9958(83)80030-8","volume":"59","author":"I. Barany","year":"1983","unstructured":"I. Barany and Z. Furedi, \u201cMental poker with three or more players,\u201d Information and Control 59 (1983), 84\u201393.","journal-title":"Information and Control"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver, \u201cNon-cryptographic fault-tolerant computing in a constant number of rounds of interaction,\u201d PODC 1989, 201\u2013209.","DOI":"10.1145\/72981.72995"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, B. Chor, and E. Kushilevitz, \u201cPrivacy, additional information, and communication,\u201d IEEE Structure in Complexity Theory 1990, 55\u201365.","DOI":"10.1109\/SCT.1990.113954"},{"key":"5_CR8","unstructured":"D. Beaver, \u201cMultiparty protocols tolerating half faulty processors,\u201d in Crypto 89."},{"key":"5_CR9","unstructured":"D. Beaver, \u201cPerfect privacy for two-party protocols,\u201d DIMACS Workshop on Distributed Computing and Cryptography, Feigenbaum and Merritt (eds.), AMS, 1990, 65\u201377."},{"key":"5_CR10","unstructured":"D. Beaver, \u201cFoundations of secure interactive computing,\u201d in Crypto 91."},{"key":"5_CR11","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 (1991) 4: 75\u2013122.","journal-title":"J. Cryptology"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"D. Beaver and J. Feigenbaum, \u201cHiding instances in multioracle queries,\u201d STACS 1990, 37\u201348.","DOI":"10.1007\/3-540-52282-4_30"},{"key":"5_CR13","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, \u201cSecurity with low communication overhead,\u201d Crypto 90."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"D. Beaver and S. Goldwasser, \u201cMultiparty computation with faulty majority,\u201d IEEE FOCS 1989, 468\u2013473.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway, \u201cThe round complexity of secure protocols,\u201d ACM STOC 1990, 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"M. Bellare, L. Cowen, and S. Goldwasser, \u201cOn the structure of secret key exchange protocols,\u201d DIMACS Workshop on Distributed Computing and Cryptography, Feigenbaum and Merritt (eds.), AMS, 1990, 79\u201392.","DOI":"10.1007\/0-387-34805-0_53"},{"key":"5_CR17","unstructured":"M. Bellare, P. Rogaway, \u201cEntity authentication and key distribution\u201d, Crypto 93."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"S.M.Bellovin, M.Merritt, \u201cLimitations of the Kerberos authentication system\u201d, ACM Computer Communication Review 20 5 (Oct.90) 119\u2013132.","DOI":"10.1145\/381906.381946"},{"key":"5_CR19","unstructured":"J. Benaloh (Cohen), \u201cSecret sharing homomorphisms: keeping shares of a secret secret,\u201d Crypto 86."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"J. Benaloh and D. Tuinstra, \u201cReceipt-Free Secret-Ballot Election\u201d ACM STOC 1994, 544\u2013553.","DOI":"10.1145\/195058.195407"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"J. Benaloh (Cohen) and M. Yung, \u201cDistributing the power of a government to enhance to privacy of voters,\u201d PODC 1986, 52\u201362.","DOI":"10.1145\/10590.10595"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, R. Canetti, and O. Goldreich, \u201cAsynchronous secure computation,\u201d ACM STOC 1993, 52\u201361.","DOI":"10.1145\/167088.167109"},{"key":"5_CR23","unstructured":"M. Ben-Or, B. Kelmer, and T. Rabin, \u201cAsynchronous secure computation with optimal resilience,\u201d ACM PODC 94."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"M. Ben-Or and R. Cleve, \u201cComputing algebraic formulas using a constant number of registers,\u201d ACM STOC 1988, 254\u2013257.","DOI":"10.1145\/62212.62236"},{"key":"5_CR25","first-page":"43","volume":"194","author":"M. Ben-Or","year":"1985","unstructured":"M. Ben-Or, O. Goldreich, S. Micali, and R. Rivest, \u201cA fair protocol for signing contracts\u201d, ICALP 1985, Springer-Verlag LNCS 194, 43\u201352.","journal-title":"Springer-Verlag LNCS"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, \u201cCompleteness theorems for noncryptographic fault-tolerant distributed computation,\u201d ACM STOC 1988, 1\u20139.","DOI":"10.1145\/62212.62213"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"R. Berger, R. Peralta, and T. Tedrick, \u201cA provably secure oblivious transfer protocol,\u201d Eurocrypt 1984, 379\u2013386.","DOI":"10.1007\/3-540-39757-4_26"},{"key":"5_CR28","volume-title":"Algebraic Coding Theory","author":"E. Berlekamp","year":"1984","unstructured":"E. Berlekamp, Algebraic Coding Theory, Aegean Park Press, Laguna Hills, CA, 1984."},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"D. Bienstock and P. Seymour, \u201cMonotonicity in graph searching,\u201d J. Algorithms 12 (1991), 230\u2013245.","journal-title":"J. Algorithms"},{"key":"5_CR30","unstructured":"R. Bird, I. Gopal, A. Herzberg, P. Janson, S. Kutten, R. Molva, M. Yung, \u201cSystematic design of two-party authentication protocols,\u201d Crypto 91."},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"M. Blom, \u201cAn optimal class of key generation systems\u201d, Eurocrypt 84, LNCS 209, Springer Verlag, 1984, 335\u2013338.","DOI":"10.1007\/3-540-39757-4_22"},{"key":"5_CR32","volume-title":"\u201cThree applications of the Oblivious Transfer","author":"M. Blum","year":"1981","unstructured":"M. Blum, \u201cThree applications of the Oblivious Transfer: University of California, Berkeley, CA, 1981."},{"key":"5_CR33","unstructured":"M. Blum, \u201cCoin flipping by telephone: a protocol for solving impossible problems,\u201d IEEE Computer Conference 1982, 133\u2013137."},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1983","unstructured":"M. Blum, \u201cHow to exchange (secret) keys,\u201d ACM Trans. Comput. Sys. 1 (1983), 175\u2013193.","journal-title":"ACM Trans. Comput. Sys."},{"key":"5_CR35","unstructured":"M. Blum, \u201cHow to prove a theorem so no one else can claim it,\u201d Proc. of the International Congress of Mathematicians, Berkeley, CA, 1986, 1444\u20131451."},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, \u201cHow to generate cryptographically strong sequences of pseudo random bits\u201d, SIAM J. Comput. 13 (1984), 850\u2013864.","journal-title":"SIAM J. Comput."},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"M. Blum, U. Vazirani, and V. Vazirani, \u201cReducibility among protocols,\u201d Crypto 83. Plenum Press, 1984.","DOI":"10.1007\/978-1-4684-4730-9_12"},{"key":"5_CR38","unstructured":"C. Blundo, A. DeSantis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, \u201cPerfectly-secure key distribution for dynamic conferences\u201d Crypto 92."},{"key":"5_CR39","unstructured":"S. Brands, \u201cElectronic cash systems based on the representation problem in groups of prime order,\u201d Crypto 93."},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau, \u201cMinimum disclosure proofs of knowledge,\u201d J. Comput. System Sci. 37 (1988).","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, and J. Robert, \u201cInformation theoretic reductions among disclosure problems,\u201d IEEE FOCS 1986, 168\u2013173.","DOI":"10.1109\/SFCS.1986.26"},{"key":"5_CR42","unstructured":"G. Brassard, C. Cr\u00e9peau, and M. Yung, \u201cPerfectly concealing computationally convincing interactive proofs in constant rounds,\u201d Theoretical Computer Science."},{"key":"5_CR43","first-page":"72","volume":"6","author":"R. Breisch","year":"1967","unstructured":"R. Breisch, \u201cAn intuitive approach to speleo-topology,\u201d Southwestern Cavers (published by the Southwestern Region of the National Speleological Society) 6 (1967), 72\u201378.","journal-title":"Southwestern Cavers (published by the Southwestern Region of the National Speleological Society)"},{"key":"5_CR44","unstructured":"M. Burrows, M. Abadi, and R. Needham, \u201cAuthentication: A practical study in belief and action,\u201d in Proc. Second Conference on Theoretical Aspects of Reasoning about Knowledge, Moshe Vardi (ed.), Morgan Kaufmann, 1988."},{"key":"5_CR45","unstructured":"R. Canetti, and A. Herzberg, \u201cMaintaining Security in the Presence of Transient Faults\u201d, Crypto 94."},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"R. Canetti, and T. Rabin, \u201cFast Asynchronous Byzantine Agreement\u201d ACM STOC 1993, 42\u201352.","DOI":"10.1145\/167088.167105"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, abd U. Vaccaro, \u201cOn the Size of Shares for Secret Sharing Schemes\u201d, J. of Cryptology, V. 6, N. 3, 157\u2013169.","DOI":"10.1007\/BF00198463"},{"key":"5_CR48","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum, \u201cUntraceable electronic mail, return addresses and digital pseudonyms,\u201d CACM 24 (1981), 84\u201388.","journal-title":"CACM"},{"key":"5_CR49","doi-asserted-by":"crossref","unstructured":"D. Chaum, \u201cSecurity without identification: transaction systems to make big brother obsolete,\u201d CACM 28, 10 (October 1985).","DOI":"10.1145\/4372.4373"},{"key":"5_CR50","unstructured":"D. Chaum, \u201cThe spymasters double-agent problem: multiparty computations secure unconditionally from minorities and cryptographically from majorities,\u201d Crypto 89."},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd, \u201cMultiparty unconditionally secure protocols,\u201d ACM STOC 1988, 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"D. Chaum, I. Damg\u00e5rd, and J. van de Graaf, \u201cMultiparty computations ensuring privacy of each party's input and correctness of the result,\u201d Crypto 87.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"5_CR53","unstructured":"D. Chaum, A. Fiat, and M. Naor, \u201cUntraceable electronic cash,\u201d Crypto 88."},{"key":"5_CR54","unstructured":"D. Chaum and T. Pederson, \u201cWallet databases with observers,\u201d Crypto 92."},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"B. Chor, M. Gereb-Graus, and E. Kushilevitz, \u201cPrivate computations over the integers,\u201d IEEE FOCS 1990, 335\u2013344.","DOI":"10.1109\/FSCS.1990.89552"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, \u201cVerifiable secret sharing and achieving simultaneity in the presence of faults,\u201d IEEE FOCS 1985, 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"5_CR57","doi-asserted-by":"crossref","unstructured":"B. Chor and E. Kushilevitz, \u201cA zero-one law for boolean privacy,\u201d ACM STOC 1989, 62\u201372.","DOI":"10.1145\/73007.73013"},{"key":"5_CR58","doi-asserted-by":"crossref","unstructured":"R. Cleve, \u201cLimits on the security of coin flips when half the processors are faulty,\u201d ACM STOC 1986, 364\u2013369.","DOI":"10.1145\/12130.12168"},{"key":"5_CR59","unstructured":"R. Cleve, \u201cControlled gradual disclosure schemes for random bits and their applications,\u201d Crypto 89."},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"J. (Benaloh) Cohen and M. Fisher, \u201cA robust and verifiable cryptographically secure election scheme,\u201d IEEE FOCS 1985, 372\u2013382.","DOI":"10.1109\/SFCS.1985.2"},{"key":"5_CR61","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"G.R. Blakley, \u201cSafeguarding Cryptographic Keys\u201d AFIPS Conf. Proc. v. 48, 1979, 313\u2013317.","journal-title":"AFIPS Conf. Proc."},{"key":"5_CR62","unstructured":"F. Cohen, Computer Viruses, Ph.D. dissertation, UCS, 1986."},{"key":"5_CR63","unstructured":"D. Coppersmith, \u201cCheating at mental poker,\u201d Crypto 85."},{"key":"5_CR64","unstructured":"C. Cr\u00e9peau, \u201cA secure poker protocol that minimizes the effect of player coalitions,\u201d Crypto 85."},{"key":"5_CR65","unstructured":"C. Cr\u00e9peau, \u201cA zero-knowledge poker protocol that achieves confidentiality of the players' strategy, or How to achieve an electronic poker face,\u201d Crypto 86."},{"key":"5_CR66","unstructured":"C. Cr\u00e9peau, \u201cEquivalence between two flavours of Oblivious Transfer,\u201d Crypto 88."},{"key":"5_CR67","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau and J. Kilian, \u201cAchieving oblivious transfer using weakened security assumptions,\u201d IEEE FOCS 1988, 42\u201352.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"5_CR68","doi-asserted-by":"crossref","unstructured":"A. DeSantis, Y. Desmedt, Y. Frankel, and M. Yung, \u201cHow to Share a Function Securely\u201d, ACM STOC 1994, 522\u2013533.","DOI":"10.1145\/195058.195405"},{"issue":"6","key":"5_CR69","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, \u201cNew directions in cryptography,\u201d IEEE Transactions on Information Theory, 22(6): 644\u2013654, 1976.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR70","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00124891","volume":"2","author":"W. Diffie","year":"1992","unstructured":"W. Diffie, P. Van Oorschot, M. Weiner, \u201cAuthentication and Authenticated Key Exchange\u201d Designs, Codes and Cryptography, 2, 1992, 107\u2013125.","journal-title":"Designs, Codes and Cryptography"},{"key":"5_CR71","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"E. W. Dijkstra, Self-Stabilizing Systems in spite of Distributed Control, CACM, 17, 1974, pp. 643\u2013644.","journal-title":"CACM"},{"key":"5_CR72","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"D. Dolev, C. Dwork, O. Waarts, and M. Yung, \u201cPerfectly secure message transmission,\u201d JACM 40 (1993), 17\u201347.","journal-title":"JACM"},{"key":"5_CR73","doi-asserted-by":"crossref","unstructured":"D. Dolev and A. Yao, \u201cOn the security of public key protocols,\u201d ACM FOCS 1981, 350\u2013357.","DOI":"10.1109\/SFCS.1981.32"},{"key":"5_CR74","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich, and A. Lempel, \u201cA randomized protocol for signing contracts,\u201d CACM 28 (1985), 637\u2013647.","journal-title":"CACM"},{"key":"5_CR75","unstructured":"S. Even, O. Goldreich, and Y. Yacobi, \u201cElectronic Wallet,\u201d Crypto 83."},{"key":"5_CR76","doi-asserted-by":"crossref","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. Cryptology 1 (1988) 77\u201394.","journal-title":"J. Cryptology"},{"key":"5_CR77","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor, \u201cA Minimal Model for Secure Computation\u201d, ACM STOC 1994, 554\u2013563.","DOI":"10.1145\/195058.195408"},{"key":"5_CR78","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali, \u201cOptimal algorithms for Byzantine agreement,\u201d ACM STOC 1988, 148\u2013161.","DOI":"10.1145\/62212.62225"},{"key":"5_CR79","unstructured":"N. Ferguson, \u201cExtensions of single-term coins,\u201d Crypto 93."},{"key":"5_CR80","unstructured":"A. Fiat and A. Shamir, \u201cHow to prove yourself: Practical solutions to identification and signature problems,\u201d Crypto86."},{"key":"5_CR81","unstructured":"S. Fortune and M. Merritt, \u201cPoker protocols,\u201d Crypto 84."},{"key":"5_CR82","unstructured":"M. Franklin, \u201cComplexity and security of distributed protocols\u201d, Ph.D. thesis, Columbia University, 1993."},{"key":"5_CR83","doi-asserted-by":"crossref","unstructured":"M. Franklin, Z. Galil, and M. Yung, \u201cEavesdropping games: A graph-theoretic approach to privacy in distributed systems,\u201d IEEE FOCS 1993, 670\u2013679.","DOI":"10.1109\/SFCS.1993.366820"},{"key":"5_CR84","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung, \u201cCommunication complexity of secure computation,\u201d ACM STOC 1992, 699\u2013710.","DOI":"10.1145\/129712.129780"},{"key":"5_CR85","unstructured":"M. Franklin and M. Yung, \u201cSecure and efficient off-line digital money,\u201d ICALP 93."},{"key":"5_CR86","unstructured":"M. Franklin and M. Yung, \u201cPrivacy from Partial Broadcast\u201d, Technical Report, CWI, Amsterdam."},{"key":"5_CR87","unstructured":"Z. Galil, S. Haber, and M. Yung, \u201cCryptographic computation: secure fault-tolerant protocols and the public-key model,\u201d Crypto 87."},{"key":"5_CR88","unstructured":"J.A. Garay, Reaching (and maintaining) agreement in the presence of mobile faults\u201d. WDAG 94."},{"key":"5_CR89","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cProofs that yield nothing but their validity and a methodology of cryptographic protocol design,\u201d IEEE FOCS 1986, 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"5_CR90","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cHow to play any mental game,\u201d ACM STOC 1987, 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"5_CR91","unstructured":"O. Goldreich and R. Vainish, \u201cHow to solve any protocol problem \u2014 an efficiency improvement,\u201d Crypto 87."},{"key":"5_CR92","unstructured":"S. Goldwasser and L. Levin, \u201cFair computation of general functions in presence of immoral majority,\u201d Crypto 89."},{"key":"5_CR93","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 and S. Micali, \u201cProbabilistic encryption,\u201d J. Comput. System Sci. 28 (1984), 270\u2013299. (STOC 82).","journal-title":"J. Comput. System Sci."},{"key":"5_CR94","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe knowledge complexity of interactive proof systems,\u201d SIAM J. Comput. 18 (1989), 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"5_CR95","unstructured":"S. Haber, \u201cMultiparty cryptographic computation: techniques and applications,\u201d Ph.D. thesis, Columbia University, 1988."},{"key":"5_CR96","doi-asserted-by":"crossref","unstructured":"J.T. Hastad, \u201cPseudo-random generators under uniform assumptions,\u201d STOC 1990, 395\u2013404.","DOI":"10.1145\/100216.100270"},{"key":"5_CR97","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad and A. Shamir, \u201cThe cryptographic security of truncated linearly related variables,\u201d STOC 1985, 356\u2013362.","DOI":"10.1145\/22145.22184"},{"key":"5_CR98","unstructured":"A. Herzberg, P. Janson, S. Kutten, R. Molva, G. Tsudik and M. Yung, KryptoKnight: Light-Weight Authentication and Key Distribution."},{"key":"5_CR99","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/0196-6774(90)90023-8","volume":"11","author":"M. Huang","year":"1990","unstructured":"M. Huang and S. Teng, \u201cSecurity, verifiability, and universality in distributed computing,\u201d J. Algorithms 11 (1990), 492\u2013521.","journal-title":"J. Algorithms"},{"key":"5_CR100","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, and M. Luby, \u201cPseudorandom number generation from one-way functions,\u201d ACM STOC 1989, 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"5_CR101","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Luby, \u201cOne-way functions are essential for complexity based cryptography,\u201d IEEE FOCS 1989, 230\u2013235.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"5_CR102","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and S. Rudich, \u201cLimits on the provable consequences of one-way permutations,\u201d ACM STOC 1989, 44\u201361.","DOI":"10.1145\/73007.73012"},{"key":"5_CR103","unstructured":"R. Impagliazzo, and M. Yung, \u201cDirect minimum-knowledge computation,\u201d Crypto 87."},{"key":"5_CR104","unstructured":"\u201cBanking \u2014 Key management (wholesale)\u201d ISO 8732, Geneva (1988)."},{"key":"5_CR105","unstructured":"\u201cOSI Directory \u2014 Part 8: Authentication Framework\u201d, ISO 9594-8, Geneva (1988)."},{"key":"5_CR106","doi-asserted-by":"crossref","unstructured":"J. Kephart and S. White, Directed-Graph Epidemiological Models of Computer Viruses, IEEE Sym. on Security and Privacy, 1991.","DOI":"10.1109\/RISP.1991.130801"},{"key":"5_CR107","doi-asserted-by":"crossref","unstructured":"J. Kilian, \u201cFounding cryptography on oblivious transfer,\u201d ACM STOC 1988, 20\u201331.","DOI":"10.1145\/62212.62215"},{"key":"5_CR108","unstructured":"J. Kilian, \u201cUses of Randomness in Algorithms and Protocols,\u201d ACM Distinguished Dissertation, MIT Press, 1990."},{"key":"5_CR109","doi-asserted-by":"crossref","unstructured":"J. Kilian, \u201cA general completeness theorem for two-party games,\u201d ACM STOC 1991, 553\u2013560.","DOI":"10.1145\/103418.103475"},{"key":"5_CR110","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"L. Kirousis","year":"1985","unstructured":"L. Kirousis and C. Papadimitriou, \u201cInterval graphs and searching,\u201d Discrete Mathematics 55 (1985) 181\u2013184.","journal-title":"Discrete Mathematics"},{"key":"5_CR111","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L. Kirousis","year":"1986","unstructured":"L. Kirousis and C. Papadimitriou, \u201cSearching and pebbling,\u201d Theoretical Computer Science 47 (1986), 205\u2013218.","journal-title":"Theoretical Computer Science"},{"key":"5_CR112","doi-asserted-by":"crossref","unstructured":"H. Krawczyk, \u201cDistributed Fingerprints and Secure Information Disperal\u201d ACM PODC 1993, 207\u2013218.","DOI":"10.1145\/164051.164075"},{"key":"5_CR113","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, \u201cPrivacy and communication complexity,\u201d IEEE FOCS 1989, 416\u2013421.","DOI":"10.1109\/SFCS.1989.63512"},{"key":"5_CR114","unstructured":"E. Kushilevitz, S. Micali, and R. Ostrovsky, \u201cReducibilities and completeness in multi-party private communication\u201d, FOCS 94."},{"key":"5_CR115","unstructured":"E. Kushilevitz and A. Ros\u00e9n, \u201cA randomness-rounds tradeoff in private computation\u201d Crypto 94."},{"key":"5_CR116","doi-asserted-by":"crossref","unstructured":"L. Lamport, R. Shostak, and M. Pease, \u201cThe Byzantine generals problem,\u201d ACM Trans. on Programming Lang. and Systems (1982), 382\u2013401.","DOI":"10.1145\/357172.357176"},{"key":"5_CR117","doi-asserted-by":"crossref","unstructured":"A. LaPaugh, \u201cRecontamination does not help to search a graph,\u201d JACM, April 1993 (originally Princeton Technical Report 335).","DOI":"10.1145\/151261.151263"},{"key":"5_CR118","unstructured":"R. Lipton, \u201cHow to cheat at mental poker,\u201d proceedings of AMS short course on cryptography, 1981."},{"key":"5_CR119","doi-asserted-by":"crossref","unstructured":"M. Luby, S. Micali, and C. Rackoff, \u201cHow to simultaneously exchange a secret bit by flipping a symmetrically-biased coin,\u201d IEEE FOCS 1984, 11\u201321.","DOI":"10.1109\/SFCS.1983.25"},{"key":"5_CR120","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou, \u201cThe complexity of searching a graph,\u201d JACM 35 (1988), 18\u201344.","journal-title":"JACM"},{"key":"5_CR121","unstructured":"M. Merritt, \u201cCryptographic protocols,\u201d Ph.D. thesis, Georgia Institute of Technology, 1983."},{"key":"5_CR122","unstructured":"S. Micali and P. Rogaway, \u201cSecure computation,\u201d Crypto 91."},{"key":"5_CR123","unstructured":"M. Naor, \u201cBit commitment using pseudo-randomness,\u201d Crypto 89."},{"key":"5_CR124","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, \u201cPerfect zero-knowledge arguments for NP can be based on general complexity assumptions,\u201d Crypto 92."},{"key":"5_CR125","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, \u201cUniversal one-way hash functions and their cryptographic applications,\u201d STOC 1989, 33\u201343.","DOI":"10.1145\/73007.73011"},{"issue":"12","key":"5_CR126","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"R. M. Needham","year":"1978","unstructured":"R. M. Needham, M. D. Schroeder, \u201cUsing encryption for authentication in large networks of computers,\u201d CACM 21 12 (1978) 993\u2013998.","journal-title":"CACM"},{"key":"5_CR127","unstructured":"T. Okamoto and K. Ohta, \u201cUniversal electronic cash,\u201d Crypto 91."},{"key":"5_CR128","doi-asserted-by":"crossref","unstructured":"A. Orlitsky and A. El Gamal, \u201cCommunication with secrecy constraints,\u201d ACM STOC 1984, 217\u2013224.","DOI":"10.1145\/800057.808684"},{"key":"5_CR129","unstructured":"R. Ostrovsky, R. Venkatesan, and M. Yung, \u201cFair games against an all-powerful adversary,\u201d Sequences Workshop, Positano, Italy, July 1991."},{"key":"5_CR130","unstructured":"R. Ostrovsky and M. Yung, \u201cOn necessary conditions for secure distributed computing,\u201d DIMACS Workshop on Distributed Computing and Cryptography, Feigenbaum and Merritt (eds.), AMS, 1990, 229\u2013234."},{"key":"5_CR131","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung, \u201cRobust computation in the presence of mobile viruses,\u201d ACM PODC 1991, 51\u201359.","DOI":"10.1145\/112600.112605"},{"key":"5_CR132","doi-asserted-by":"crossref","unstructured":"T. Parsons, \u201cPursuit-evasion in a graph,\u201d in \u201cTheory and application of graphs,\u201d (Y. Alavi and D. Lick, eds.), Springer-Verlag (1976), 426\u2013441.","DOI":"10.1007\/BFb0070400"},{"key":"5_CR133","first-page":"155","volume-title":"Foundations of Secure Computation","author":"M. Rabin","year":"1978","unstructured":"M. Rabin, \u201cDigital signatures,\u201d in Foundations of Secure Computation, R. DeMillo, D. Dobkin, A. Jones, and R. Lipton (editors), Academic Press, NY, 1978, 155\u2013168."},{"key":"5_CR134","unstructured":"M. Rabin, \u201cHow to exchange secrets by oblivious transfer,\u201d Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981."},{"issue":"2","key":"5_CR135","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"M. Rabin","year":"1983","unstructured":"M. Rabin, \u201cTransaction Protection by Beacon\u201d J. Comp. Sys. Sci. 27, 2, 1983, 256\u2013267.","journal-title":"J. Comp. Sys. Sci."},{"key":"5_CR136","unstructured":"T. Rabin, \u201cRobust sharing of secrets when the dealer is honest or cheating,\u201d M.Sc. Thesis, Hebrew University, 1988."},{"key":"5_CR137","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or, \u201cVerifiable secret sharing and multiparty protocols with honest majority,\u201d ACM STOC 1989, 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"5_CR138","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman, \u201cA method for obtaining digital signatures and public key cryptosystems,\u201d CACM 21 (1978), 120\u2013126.","journal-title":"CACM"},{"key":"5_CR139","doi-asserted-by":"crossref","unstructured":"J. Rompel, \u201cOne-way functions are necessary and sufficient for secure signatures,\u201d STOC 1990, 387\u2013394.","DOI":"10.1145\/100216.100269"},{"key":"5_CR140","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, \u201cHow to share a secret,\u201d CACM 22 (1979), 612\u2013613.","journal-title":"CACM"},{"key":"5_CR141","unstructured":"A. Shamir, R. Rivest, and L. Adleman, \u201cMental poker,\u201d Technical Report MIT\/LCS\/TR-125, M.I.T., 1979."},{"key":"5_CR142","unstructured":"G. Steiner, C. Neuman, J. I. Schiller, \u201cKerberos: an authentication server for open network systems\u201d, Proc. Usenix Conf. (Winter 88)."},{"key":"5_CR143","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, \u201cRandom self-reducibility and zero knowledge interactive proofs of possession of information,\u201d IEEE FOCS 1987, 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"},{"key":"5_CR144","doi-asserted-by":"crossref","unstructured":"U. Vazirani and V. Vazirani, \u201cTrapdoor pseudo-random number generators, with applications to protocol design,\u201d IEEE FOCS 1983, 23\u201330.","DOI":"10.1109\/SFCS.1983.78"},{"key":"5_CR145","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cSome complexity questions related to distributive computing,\u201d ACM STOC 1979, 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"5_CR146","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cProtocols for secure computations,\u201d IEEE FOCS 1982, 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"5_CR147","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cHow to generate and exchange secrets,\u201d IEEE FOCS 1986, 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"},{"key":"5_CR148","unstructured":"M. Yung, \u201cCryptoprotocols: subscription to a public key, the secret blocking and the multi-player mental poker game,\u201d Crypto 84."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:02:52Z","timestamp":1736082172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":148,"URL":"https:\/\/doi.org\/10.1007\/bfb0020424","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}