Abstract

In our opinion, the Foundations of Cryptography are the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. In this essay, we survey some of these paradigms, approaches and techniques as well as some of the fundamental results obtained using them. Special effort is made in attempt to dissolve common misconceptions regarding these paradigms and results. c flCopyright 1998 by Oded Goldreich. Permission to make copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Abstracting with credit is permitted. A preliminary version of this essay has appeared in the proceedings of Crypto97 (Springer's Lecture Notes in Computer Science, Vol. 1294). 0 Contents 1 Introduction 2 I Basic Tools 6 2 Central Paradigms 6 2.1 Computati...

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
2292	New Directions in Cryptography - Diffie, Hellman - 1976
1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
1001	Probabilistic encryption - Goldwasser, Micali - 1984
893	The knowledge complexity of interactive proof systems - Goldwasser, Micali, et al. - 1989
711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
574	A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation - Ben-Or, Goldwasser, et al. - 1988
544	How to construct random functions - Goldreich, Goldwasser, et al. - 1986
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
453	Theory and applications of trapdoor functions - Yao - 1982
443	How to generate and exchange secrets - Yao - 1986
425	How to play any mental game, or a completeness theorem for protocols with honest majority - Goldreich, Micali, et al. - 1987
404	Keying hash functions for message authentication - Bellare, Canetti, et al. - 1996
388	Entity authentication and key distribution - Bellare, Rogaway - 1994
366	I.: Multiparty unconditionally secure protocols - Chaum, Crépeau, et al. - 1988
356	Blind Signatures for Untraceable Payments - Chaum - 1982
347	Private information retrieval - Chor, Goldreich, et al. - 1998
327	Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems - Goldreich, Micali, et al. - 1991
309	Safeguarding cryptographic keys - Blakley - 1979
288	The exact security of digital signatures - how to sign with rsa and rabin - Bellare, Rogaway - 1996
264	Minimum Disclosure Proofs of Knowledge - Brassard, Chaum, et al. - 1988
241	Untraceable electronic cash - Chaum, Fiat, et al. - 1988
238	On the importance of checking cryptographic protocols for faults - Boneh, Demillo, et al.
233	Protocols for public key cryptosystems - Merkle - 1980
231	A design principle for hash functions - Damgård - 1989
185	Provably secure session key distribution---the three party case - Bellare, Rogaway - 1995
176	B.: Verifiable secret sharing and achieving simultaneity in the presence of faults - Chor, Goldwasser, et al. - 1985
168	On the composition of zero-knowledge proof systems - Goldreich, Krawczyk - 1996
140	Foundations of cryptography (fragments of a book - Goldreich - 1995
138	Limits on the provable consequences of oneway permutations - Impagliazzo, Rudich - 1988
137	The security of cipher block chaining - Bellare, Kilian, et al. - 1994
121	Multi-prover interactive proofs: how to remove intractability assumptions - Ben-Or, Goldwasser, et al. - 1988
121	Foundations of secure interactive computing - Beaver - 1991
121	On Defining Proofs of Knowledge - Bellare, Goldreich - 1993
120	C.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole - Alexi, Chor, et al. - 1988
109	XOR MACs: New methods for message authentication using finite pseudorandom functions - Bellare, Guérin, et al. - 1995
104	Non-Interactive Zero-Knowledge and its Applications - Blum, Feldman, et al. - 1988
102	An efficient probabilistic public-key encryption scheme which hides all partial information - Blum, Goldwasser - 1985
87	Collision free hash functions and public key signature schemes - Damg˚ard
84	Digitalized signatures - Rabin - 1978
80	Towards realizing random oracles: Hash functions that hide all partial information - Canetti - 1997
79	Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security - Bellare, Canetti, et al. - 1996
74	Universal Hash Functions - Carter, Wegman - 1979
72	Studies in Secure Multiparty Computation and Applications - Canetti - 1995
65	How to exchange (secret) keys - Blum - 1983
60	On-line/o#-line digital signatures - Even, Goldreich, et al. - 1990
59	Incremental Cryptography: The Case of Hashing and Signing - Bellare, Goldreich, et al. - 1994
59	Limits on the security of coin flips when half the processors are faulty (extended abstract - Cleve - 1986
54	Non-Interactive Zero-Knowledge Proof-Systems - Santis, Micali, et al.
49	Maintaining Security in the Presence of Transient Faults - Canetti, Herzberg - 1994