Secure Distributed Computing: Theory and Practice

The general area of secure distributed computing and the interplay between distributed computing and security/ cryptography research is reviewed. Recent theoretical and practical developments are discussed.

[1]  Claude Crépeau,et al.  A Zero-Knowledge Poker Protocol That Achieves Confidentiality of the Players' Strategy or How to Achieve an Electronic Poker Face , 1986, CRYPTO.

[2]  Rafail Ostrovsky,et al.  Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract) , 1992, CRYPTO.

[3]  Niels Ferguson,et al.  Extensions of Single-term Coins , 1993, CRYPTO.

[4]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[5]  David Chaum,et al.  Security without identification: transaction systems to make big brother obsolete , 1985, CACM.

[6]  Lenore Cowen,et al.  On the Structure of Secret Key Exchange Protocols , 1989, Distributed Computing And Cryptography.

[7]  Paul C. van Oorschot,et al.  Authentication and authenticated key exchanges , 1992, Des. Codes Cryptogr..

[8]  Matthew K. Franklin,et al.  Eavesdropping games: a graph-theoretic approach to privacy in distributed systems , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[9]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[11]  Moti Yung,et al.  Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols , 1991, Theor. Comput. Sci..

[12]  Nancy A. Lynch,et al.  Cryptographic protocols , 1982, STOC '82.

[13]  Shang-Hua Teng,et al.  Security, Verifiability, and Universality in Distributed Computing , 1990, J. Algorithms.

[14]  Moti Yung,et al.  Direct Minimum-Knowledge Computations , 1987, CRYPTO.

[15]  Rafail Ostrovsky,et al.  Reducibility and completeness in multi-party private computations , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[16]  Moti Yung,et al.  Perfectly secure message transmission , 1993, JACM.

[17]  Russell Impagliazzo,et al.  Limits on the provable consequences of one-way permutations , 1988, STOC '89.

[18]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[19]  Gilles Brassard,et al.  Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[20]  Andrew Chi-Chih Yao,et al.  How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[21]  Silvio Micali,et al.  How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[22]  Josh Benaloh,et al.  Receipt-free secret-ballot elections (extended abstract) , 1994, STOC '94.

[23]  Russell Impagliazzo,et al.  One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.

[24]  Amos Fiat,et al.  Zero-knowledge proofs of identity , 1987, Journal of Cryptology.

[25]  Hugo Krawczyk.  Distributed fingerprints and secure information dispersal , 1993, PODC '93.

[26]  Richard Cleve,et al.  Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.

[27]  Rafail Ostrovsky,et al.  Fair Games against an All-Powerful Adversary , 1990, Advances In Computational Complexity Theory.

[28]  Moti Yung,et al.  Distributing the power of a government to enhance the privacy of voters , 1986, PODC '86.

[29]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[30]  Judit Bar-Ilan,et al.  Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.

[31]  Leonid A. Levin,et al.  Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.

[32]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[33]  Donald Beaver,et al.  Multiparty computation with faulty majority , 1989, 30th Annual Symposium on Foundations of Computer Science.

[34]  Joe Kilian,et al.  Founding crytpography on oblivious transfer , 1988, STOC '88.

[35]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[36]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[37]  Imre Bárány,et al.  Mental Poker with Three or More Players , 1983, Inf. Control..

[38]  Jeffrey O. Kephart,et al.  Directed-graph epidemiological models of computer viruses , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[39]  Martin Tompa,et al.  Random self-reducibility and zero knowledge interactive proofs of possession of information , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[40]  Josh Benaloh,et al.  Receipt-Free Secret-Ballot Elections , 1994, STOC 1994.

[41]  Manuel Blum,et al.  Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.

[42]  Fred Cohen,et al.  Computer viruses—theory and experiments , 1990 .

[43]  Matthew Franklin,et al.  Complexity and security of distributed protocols , 1994 .

[44]  Silvio Micali,et al.  Optimal algorithms for Byzantine agreement , 1988, STOC '88.

[45]  Alon Orlitsky,et al.  Communication with secrecy constraints , 1984, STOC '84.

[46]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[47]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[48]  Donald Beaver,et al.  Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.

[49]  Ran Canetti,et al.  Asynchronous secure computation , 1993, STOC.

[50]  David Chaum,et al.  Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result , 1987, CRYPTO.

[51]  Joe Kilian,et al.  Achieving oblivious transfer using weakened security assumptions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[52]  Manuel Blum,et al.  Reducibility Among Protocols , 1983, CRYPTO.

[53]  Moni Naor,et al.  Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.

[54]  Don Coppersmith,et al.  Cheating at Mental Poker , 1985, CRYPTO.

[55]  Moti Yung,et al.  How to share a function securely , 1994, STOC '94.

[56]  Donald Beaver.  Perfect Privacy For Two-Party Protocols , 1989, Distributed Computing And Cryptography.

[57]  Moni Naor,et al.  A minimal model for secure computation (extended abstract) , 1994, STOC '94.

[58]  Moti Yung,et al.  Systematic Design of Two-Party Authentication Protocols , 1991, CRYPTO.

[59]  Rolf Blom,et al.  An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.

[60]  Michael O. Rabin,et al.  Transaction Protection by Beacons , 1983, J. Comput. Syst. Sci..

[61]  Donald Beaver,et al.  Foundations of Secure Interactive Computing , 1991, CRYPTO.

[62]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[63]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[64]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[65]  Matthew K. Franklin,et al.  Secure and Efficient Off-Line Digital Money (Extended Abstract) , 1993, ICALP.

[66]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[67]  Moni Naor,et al.  Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.

[68]  Ran Canetti,et al.  Maintaining Security in the Presence of Transient Faults , 1994, CRYPTO.

[69]  Reuven Bar-Yehuda,et al.  Privacy, additional information, and communication , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[70]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[71]  Claude Crépeau,et al.  Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.

[72]  Mihir Bellare,et al.  Entity Authentication and Key Distribution , 1993, CRYPTO.

[73]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[74]  Claude Crépeau,et al.  A Secure Poker Protocol that Minimizes the Effect of Player Coalitions , 1986, CRYPTO.

[75]  Steven M. Bellovin,et al.  Limitations of the Kerberos authentication system , 1990, CCRV.

[76]  Joe Kilian,et al.  Uses of randomness in algorithms and protocols , 1990 .

[77]  Martín Abadi,et al.  On Hiding Information from an Oracle , 1987, Proceeding Structure in Complexity Theory.

[78]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[79]  Vijay V. Vazirani,et al.  Trapdoor pseudo-random number generators, with applications to protocol design , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[80]  Eyal Kushilevitz,et al.  Private computations over the integers , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[81]  Matthew K. Franklin,et al.  Communication complexity of secure computation (extended abstract) , 1992, STOC '92.

[82]  Moti Yung,et al.  Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.

[83]  Oded Goldreich,et al.  How to Solve any Protocol Problem - An Efficiency Improvement , 1987, CRYPTO.

[84]  Manuel Blum,et al.  How to exchange (secret) keys , 1983, TOCS.

[85]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[86]  Richard Cleve,et al.  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications , 1989, CRYPTO.

[87]  David Chaum,et al.  Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..

[88]  Moti Yung,et al.  Privacy from partial broadcast , 1994 .

[89]  Joe Kilian,et al.  A general completeness theorem for two party games , 1991, STOC '91.

[90]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[91]  Stuart Alan Haber.  Multiparty cryptographic computation: techniques and applications , 1988 .

[92]  Eyal Kushilevitz,et al.  A zero-one law for Boolean privacy , 1989, STOC '89.

[93]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[94]  Juan A. Garay,et al.  Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract) , 1994, WDAG.

[95]  David Chaum,et al.  The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities , 1989, CRYPTO.

[96]  Michael J. Fischer,et al.  A robust and verifiable cryptographically secure election scheme , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[97]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[98]  Silvio Micali,et al.  A Fair Protocol for Signing Contracts (Extended Abstract) , 1985, ICALP.

[99]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[100]  Joan Feigenbaum,et al.  Security with Low Communication Overhead , 1990, CRYPTO.

[101]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[102]  Michael Merritt,et al.  Poker Protocols , 1985, CRYPTO.

[103]  Danny Dolev,et al.  On the Security of Public Key Protocols (Extended Abstract) , 1981, FOCS.

[104]  Martín Abadi,et al.  Authentication: A Practical Study in Belief and Action , 1988, TARK.

[105]  Eyal Kushilevitz,et al.  Privacy and communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.

[106]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[107]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[108]  Richard Berger,et al.  A Provably Secure Oblivious Transfer Protocol , 1985, EUROCRYPT.

[109]  Silvio Micali,et al.  The round complexity of secure protocols , 1990, STOC '90.

[110]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[111]  Johan Håstad,et al.  Pseudo-random generators under uniform assumptions , 1990, STOC '90.

[112]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[113]  Tatsuaki Okamoto,et al.  Universal Electronic Cash , 1991, CRYPTO.

[114]  Tal Rabin,et al.  Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.

[115]  Mordechai M. Yung,et al.  Cryptoprotocols: Subscription to a public key, the secret blocking and the multi-player mental poker game , 1985, CRYPTO 1985.

[116]  Moti Yung,et al.  The KryptoKnight family of light-weight protocols for authentication and key distribution , 1995, TNET.

[117]  John Rompel,et al.  One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.

[118]  David Chaum,et al.  Wallet Databases with Observers , 1992, CRYPTO.

[119]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[120]  Michael Ben-Or,et al.  Computing algebraic formulas with a constant number of registers , 1988, STOC '88.

[121]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[122]  Christos H. Papadimitriou,et al.  Interval graphs and seatching , 1985, Discret. Math..

[123]  Moti Yung,et al.  Perfectly Secure Key Distribution for Dynamic Conferences , 1992, Inf. Comput..

[124]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[125]  Richard J. Lipton,et al.  Foundations of Secure Computation , 1978 .

[126]  Adi Shamir,et al.  The cryptographic security of truncated linearly related variables , 1985, STOC '85.