Studies in secure multiparty computation and applications

Acknowledgements First, a very special thanks is due to Oded Goldreich, my advisor. On top of being an expert on experts, and a dear friend, he is a devoted advisor, far beyond the ordinary. Oded has the special property of always searching for the crux of any matter, and disgustedly ridding himself of the rest. Once he sets his mind to a particular goal, he is thoroughly and uncompromisingly dedicated. This, together with his sharpness, his peculiar sense of humor, and his natural good-heartedness, make him a remarkable person indeed. My interaction with Oded deeply aaected my approach to research, and to life in general. Time and again, his unconventional approach rst looks odd, and after some thought it becomes clear that his is the direct, simple and natural approach. It also becomes totally unclear how I ever thought otherwise. His colorful and creative feedback on my writing style has made each one of my drafts a museum piece. His feedback also spiced up my fearful anticipation of their return (which has happened at an amazing speed). I am also thankful for the practical training I received in the art of dodging ying shoes. During my years of study, I have made some special acquaintances from whom I have learned a lot. Among these let me mention Benny Chor, Amir Herzberg (who is the most practical person I know), Hugo Krawzcyk, and Yishay Mansour. I have also enjoyed working with, and learned a lot from many many people. A very partial list includes Amotz Bar-Noy, Next I wish to thank my collaborators on the results that make up this thesis. I have enjoyed, and learned a lot from interacting with them. The chapter on adaptive security in the computational setting (Chapter 3) describes joint work with Uri Feige, Oded Goldreich and Moni Naor. The chapter on asynchronous secure computation (Chapter 4) describes joint work with Oded Goldreich and Michael Ben-Or. The chapter on asynchronous Byzan-tine agreement (Chapter 5) describes joint work with Tal Rabin. The chapter on Proactive Security (Chapter 6) describes joint work with Amir Herzberg. I have not found an appropriate list for Dana Ron, but I still thank her for her company, and for sharing a bottle of wine in countless dinners... A nal thanks is to Ronitt, who besides being my source of happiness and sound support, has taught me more than a couple of things …

[1]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[2]  Silvio Micali,et al.  An Optimal Algorithm for Synchronous Byzantine Agreement , 1997 .

[3]  Cliff Stoll.  How secure are computers in the U.S.A.?: An analysis of a series of attacks on Milnet computers , 1988, Comput. Secur..

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

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

[6]  Silvio Micali,et al.  Byzantine agreement in constant expected time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[8]  Alfredo De Santis,et al.  Zero-knowledge proofs of knowledge without interaction , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  Jon A. Rochlis,et al.  With microscope and tweezers: an analysis of the Internet virus of November 1988 , 1989, Proceedings. 1989 IEEE Symposium on Security and Privacy.

[10]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  E. Eugene Schultz,et al.  Beyond preliminary analysis of the WANK and OILZ worms: a case study of malicious code , 1993, Comput. Secur..

[12]  Gabriel Bracha,et al.  An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.

[13]  Ran Canetti,et al.  How to Maintain Authenticated Communication in the Presence of Break-ins , 1996 .

[14]  Oded Goldreich,et al.  Foundations of Cryptography (Fragments of a Book) , 1995 .

[15]  Eric Bach,et al.  How to Generate Factored Random Numbers , 1988, SIAM J. Comput..

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

[17]  Silvio Micali,et al.  On the Cryptographic Applications of Random Functions , 1984, CRYPTO.

[18]  Cynthia Dwork,et al.  Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..

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

[20]  Hugo Krawczyk,et al.  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.

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

[22]  Donald Beaver,et al.  Cryptographic Protocols Provably Secure Against Dynamic Adversaries , 1992, EUROCRYPT.

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

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

[25]  Rafail Ostrovsky,et al.  How To Withstand Mobile Virus Attacks , 1991, PODC 1991.

[26]  Kazue Sako,et al.  Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth , 1995, EUROCRYPT.

[27]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[28]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[29]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[30]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[31]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[32]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

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

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

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

[36]  Benny Chor,et al.  Solvability in asynchronous environments , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

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

[39]  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).

[40]  Rüdiger Reischuk,et al.  A New Solution for the Byzantine Generals Problem , 1985, Inf. Control..

[41]  Moti Yung,et al.  Systematic Design of a Family of Attack-Resistant Authentication Protocols , 1993, IEEE J. Sel. Areas Commun..

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

[43]  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).