MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  On the foundations of modern cryptography (1997) [20 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Oded Goldreich
Lecture Notes in Computer Science
ftp://theory.lcs.mit.edu/pub/people/oded/focB.ps
Add To MetaCart

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. 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. It is possible to build a cabin with no foundations, but not a lasting building. Eng. Isidor Goldreich (1906--1995) Cryptography is concerned with the construction of schemes which are robust against malicious attempts to make these schemes deviate from their prescribed functionality. Given a desired functionality, a cryptographer should design a scheme which not only satisfies the desired functionality under "normal operation", but also maintains this functionality in face of adversarial attempts which are devised after the cryptographer has completed his/her work. The fact that an adversary will devise its attack after the scheme has been specified makes the design of such schemes very hard. In particular, the adversary will try to take actions other than the ones the designer had envisioned. Thus, our approach is that it makes little sense to make assumptions regarding the specific strategy that the adversary may use. The only assumptions which can be justified refer to the computational abilities of the adversary. Furthermore, it is our opinion that the design of cryptographic systems has to be based on firm foundations; whereas ad-hoc approaches and heuristics are a very dangerous way to go. A heuristic may make sense when the designer has a very good idea about the environment in which a scheme is to operate, yet a cryptographic scheme has to operate in a maliciously selected environment which typically transcends the designer's view. Providing firm foundations to Cryptography has been a major research direction in the last two decades. Indeed, the pioneering paper of Diffie and Hellman [8] should be considered the initiator of this direction. Two major (interleaved) activities have been:

Citations

1976 A method for obtaining digital signatures and public-key cryptosystems – Rivest, Shamir, et al. - 1978
1751 New directions in cryptography – Diffie, Hellman - 1976
844 Probabilistic encryption – Goldwasser, Micali - 1984
692 The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract – Goldwasser, Micali, et al. - 1985
610 A digital signature scheme secure against adaptive chosen-message attacks – Goldwasser, Micali, et al. - 1988
480 How to construct random functions – Goldreich, Goldwasser, et al. - 1986
466 How to generate Cryptographically Strong Sequences of Pseudo-Random Bits – Blum, Micali - 1984
415 Theory and applications of trapdoor functions – Yao - 1982
328 A “HOW to Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority – Goldreich, Micali, et al. - 1987
323 Entity Authentication and Key Distribution – Bellare, Rogaway - 1995
304 How to generate and exchange secrets – Yao - 1986
241 Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems – Goldreich, Micali, et al. - 1991
171 Protocols for Public Key Cryptosystems – Merkle - 1980
170 Provably secure session key distribution: the three party case – Bellare, Rogaway - 1995
164 Foundations of Cryptography (Fragments of a Book). Weizmann institute of science – Goldreich - 1995
138 On the composition of zero-knowledge proof systems – Goldreich, Krawczyk - 1996
109 Multi-prover interactive proofs: How to remove intractability – Ben-Or, Goldwasser, et al. - 1988
106 Limits on the provable consequences of one-way permutations – Impagliazzo, Rudich - 1989
86 An efficient probabilistic public-key encryption scheme which hides all partial information – Blum, Goldwasser - 1985
86 On-line/off-line digital signatures – Even, Goldreich, et al. - 1996
62 Digitalized Signatures – Rabin - 1977
44 Incremental cryptography: The case of hashing and signing – Bellare, Goldreich, et al. - 1994
38 An efficient existentially unforgeable signature scheme and its applications – Dwork, Naor
33 Fair public-key cryptosystems – Micali - 1993
24 Incremental cryptography and application to virus protection – Bellare, Goldreich, et al.
1 A Certified Digital Signature Scheme – Merkle