Oded Goldreich  Home/Search
Context Related
| mit.edu/pub/people/oded/foc3.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: mit.edu/~oded/tfoc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ... (Update)
Cited by: More
GEM: a Generic Chosen-Ciphertext Secure Encryption Method - Coron, al. (2002) (Correct)
Universal Exponentiation Algorithm - A First Step towards.. - Clavier, Joye (2001) (Correct)
GEM: a Generic Chosen-Ciphertext Secure - Encryption Method Published (Correct)
Similar documents (at the sentence level): More
74.2%: The Foundations of Modern Cryptography - Goldreich (1997) (Correct)
7.0%: CryptoBytes - The Technical Newsletter (Correct)
6.9%: On the Foundations of Modern Cryptography - Goldreich (1997) (Correct)
Active bibliography (related documents): More All
0.9: Lecture Notes on Cryptography - Goldwasser, Bellare (1996) (Correct)
0.6: Foundations of Cryptography - Goldreich (2004) (Correct)
0.6: Zero-Knowledge twenty years after its invention - Goldreich (2002) (Correct)
Similar documents based on text: More All
0.4: Computational Indistinguishability: A Sample Hierarchy - Goldreich, Sudan (1999) (Correct)
0.3: Pseudorandomness - Goldreich (1999) (Correct)
0.3: Probabilistic Proof Systems - Part I - Vadhan (2000) (Correct)
Related documents from co-citation: More All
15: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
13: Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
11: An extended abstract appears in H (context) - Bellare, Desai et al. - 1998
BibTeX entry: (Update)
O. Goldreich, "On the foundations of modern cryptography," Advances in Cryptology -- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997. http://citeseer.ist.psu.edu/article/goldreich98foundations.html More
@article{ goldreich97foundations,
author = "Oded Goldreich",
title = "On the Foundations of Modern Cryptography",
journal = "Lecture Notes in Computer Science",
volume = "1294",
pages = "46--74",
year = "1997",
url = "citeseer.ist.psu.edu/article/goldreich98foundations.html" }
Citations (may not include all citations):1529 A Method for Obtaining Digital Signatures and Public Key Cry.. - Rivest, Shamir et al. - 1978
659 Random Oracles are Practical: a Paradigm for Designing Effic.. - Bellare, Rogaway - 1993 DBLP
645 How to Share a Secret (context) - Shamir - 1979 ACM DBLP
635 New Directions in Cryptography - Diffie, Hellman - 1976 ACM
501 A Digital Signature Scheme Secure Against Adaptive Chosen-Me.. - Goldwasser, Micali et al. - 1988 ACM DBLP
419 How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986 ACM DBLP
411 How to Prove Yourself: Practical Solution to Identification .. - Fiat, Shamir - 1987
339 Theory and Application of Trapdoor Functions (context) - Yao - 1982
326 Non-Malleable Cryptography - Dolev, Dwork et al. - 1991 ACM
287 Multi-party unconditionally Secure Protocols (context) - Chaum, Cr'epeau et al. - 1988
256 Reaching agreement in the presence of faults (context) - Pease, Shostak et al. - 1980 ACM DBLP
255 Untraceable Electronic Cash (context) - Chaum, Fiat et al. ACM DBLP
246 The Exact Security of Digital Signatures: How to Sign with R.. - Bellare, Rogaway
241 Communication Theory of Secrecy Systems (context) - Shannon - 1949
239 Blind Signatures for Untraceable Payments (context) - Chaum - 1983 DBLP
219 Completeness Theorems for Non-Cryptographic Fault-Tolerant D.. (context) - Ben-Or, Goldwasser et al. - 1988 ACM
208 Universal One-Way Hash Functions and their Cryptographic App.. - Naor, Yung - 1989
206 Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988 ACM DBLP
197 A Randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985 ACM DBLP
193 Threshold Cryptosystems (context) - Desmedt, Frankel ACM DBLP
191 New Hash Functions and their Use in Authentication and Set E.. (context) - Wegman, Carter - 1981 DBLP
189 Keying Hash Functions for Message Authentication - Bellare, Canetti et al. ACM DBLP
188 Entity Authentication and Key Distribution (context) - Bellare, Rogaway - 1994 ACM DBLP
185 How to Generate and Exchange Secrets (context) - Yao - 1986
177 Public-Key Cryptosystems Provably Secure Against Chosen Ciph.. - Naor, Yung - 1990 ACM DBLP
174 Safeguarding Cryptographic Keys (context) - Blakley - 1979
174 Private Information Retrieval - Chor, Goldreich et al. - 1995 ACM DBLP
174 How to Exchange Secrets by Oblivious Transfer (context) - Rabin - 1981
173 How to Construct Pseudorandom Permutations from Pseudorandom.. (context) - Luby, Rackoff - 1988 ACM DBLP
154 Secure Multi-Party Computation - Goldreich
147 Efficient Signature Generation by Smart Cards (context) - Schnorr - 1991 DBLP
143 Digital Signature Standard (context) - for, Technology - 1991
135 the Importance of Checking Cryptographic Protocols for Fault.. - Boneh, DeMillo et al. - 1997
133 A Practical Scheme for Non-interactive Verifiable Secret Sha.. (context) - Feldman - 1987 DBLP
130 Provably Secure Session Key Distribution: The Three Party Ca.. - Bellare, Rogaway - 1995 DBLP
127 Verifiable Secret Sharing and Multi-party Protocols with Hon.. (context) - Rabin, Ben-Or - 1989
120 Robust Threshold DSS Signatures - Gennaro, Jarecki et al. ACM DBLP
120 Secure Computation (context) - Micali, Rogaway
119 Protocols for public key cryptosystems (context) - Merkle - 1980 DBLP
119 How to Withstand Mobile Virus Attacks (context) - Ostrovsky, Yung - 1991
114 Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen.. (context) - Rackoff, Simon ACM DBLP
111 the Composition of Zero-Knowledge Proof Systems - Goldreich, Krawczyk - 1996
109 Digitalized Signatures and Public Key Functions as Intractab.. (context) - Rabin - 1979
109 Verifiable Secret Sharing and Achieving Simultaneity in the .. (context) - Chor, Goldwasser et al. - 1985
100 A Digital Signature Based on a Conventional Encryption Funct.. (context) - Merkle - 1987 ACM DBLP
99 One-way Functions are Necessary and Sufficient for Secure Si.. (context) - Rompel - 1990 ACM DBLP
98 How to Play any Mental Game -- A Completeness Theorem for Pr.. (context) - Goldreich, Micali et al. - 1987
98 Fair Computation of General Functions in Presence of Immoral.. (context) - Goldwasser, Levin ACM DBLP
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996 ACM
97 the Security of Public-Key Protocols (context) - Dolev, Yao - 1983
95 The Security of Cipher Block Chaining - Bellare, Kilian et al. ACM DBLP
95 Limits on the Provable Consequences of One-Way Permutations - Impagliazzo, Rudich - 1989 ACM DBLP
95 Multiple Non-Interactive Zero-Knowledge Proofs Based on a Si.. (context) - Feige, Lapidot et al. - 1990
84 XOR MACs: New Methods for Message Authentication using Finit.. (context) - Bellare, Guerin et al. DBLP
84 Society and group oriented cryptography: A new concept (context) - Desmedt DBLP
83 Multi-Prover Interactive Proofs: How to Remove Intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988 ACM
81 Pricing via Processing or Combatting Junk Mail (context) - Dwork, Naor ACM DBLP
81 Replication is not Needed: A Single Database (context) - Kushilevitz, Ostrovsky - 1997
80 Studies in Secure Multi-Party Computation and Applications - Canetti - 1995
79 One-Way Functions are Essential for Complexity Based Cryptog.. (context) - Impagliazzo, Luby - 1989
78 Foundations of Secure Interactive Computing (context) - Beaver ACM DBLP
77 the Construction of Pseudo-Random Permutations: LubyRackoff .. - Naor, Reingold - 1997
77 Non-Interactive Zero-Knowledge and its Applications (context) - Blum, Feldman et al. - 1988 ACM
72 How to Share a Function Securely (context) - De-Santis, Desmedt et al. - 1994 ACM DBLP
70 Hiding Information and Signatures in Trapdoor Knapsacks (context) - Merkle, Hellman - 1978
69 Zero-Knowledge Proofs of Knowledge in Two Rounds (context) - Feige, Shamir
68 Secret key agreement by public discussion from common inform.. - Maurer - 1993
68 One-Way Function and Pseudorandom Generators (context) - Levin - 1987
68 Computationally Private Information Retrieval - Chor, Gilboa - 1997
67 Definitions and Properties of Zero-Knowledge Proof Systems - Goldreich, Oren - 1994 DBLP
65 Proactive public key and signature systems - Herzberg, Jakobsson et al. - 1997 ACM DBLP
63 An Efficient Probabilistic Public-Key Encryption Scheme whic.. (context) - Blum, Goldwasser DBLP
61 A Design Principle for Hash Functions (context) - Damgard ACM DBLP
61 The Complexity of Promise Problems with Applications to Publ.. (context) - Even, Selman et al. - 1984 ACM DBLP
60 Hard-core Predicates for any One-Way Function (context) - Goldreich, Levin - 1989
58 On Defining Proofs of Knowledge - Bellare, Goldreich ACM DBLP
57 Software Protection and Simulation on Oblivious RAMs - Goldreich, Ostrovsky - 1996 ACM DBLP
56 Collision Free Hash Functions and Public Key Signature Schem.. (context) - Damgard DBLP
55 A Uniform Complexity Treatment of Encryption and Zero-Knowle.. - Goldreich - 1993
55 Number-theoretic constructions of efficient pseudo-random fu.. - Naor, Reingold - 1997
52 The wire-tap channel (context) - Wyner - 1975
49 Incremental Cryptography: the Case of Hashing and Signing - Bellare, Goldreich et al. - 1994 DBLP
45 Secure Communication over Insecure Channels (context) - Merkle - 1978
42 Towards Realizing Random Oracles: Hash Functions that Hide A.. - Canetti DBLP
41 One-Way Functions are essential for Non-Trivial ZeroKnowledg.. - Ostrovsky, Wigderson - 1993
41 Fair Public-Key Cryptosystems (context) - Micali ACM DBLP
40 Maintaining Security in the Presence of Transient Faults (context) - Canetti, Herzberg ACM DBLP
39 or How to Cope with Perpetual Leakage (context) - Herzberg, Jarecki et al.
39 Pseudorandom functions Revisited: The Cascade Construction a.. - Bellare, Canetti et al. - 1996 DBLP
38 Witness Indistinguishability and Witness Hiding Protocols (context) - Feige, Shamir - 1990
37 the Security of Multi-party Ping-Pong Protocols - Even, Goldreich - 1983
36 Security Preserving Amplification of Hardness - Goldreich, Impagliazzo et al. - 1990 DBLP
36 Non-Interactive Zero-Knowledge Proof Systems (context) - Blum, De Santis et al. - 1991 ACM DBLP
36 Universal Hash Functions (context) - Carter, Wegman - 1979
35 A Note on Efficient Zero-Knowledge Proofs and Arguments (context) - Kilian - 1992
35 Bit Commitment using Pseudorandom Generators (context) - Naor - 1991
32 Synthesizers and their Application to the Parallel Construct.. - Naor, Reingold - 1995 ACM DBLP
32 New Generation of Secure and Practical RSA-based Signatures - Cramer, Damgard ACM DBLP
31 Visual Cryptography - Naor, Shamir - 1995 ACM DBLP
31 Digitalized Signatures (context) - Rabin - 1977
31 Anonymous Communication and Anonymous Cash (context) - Simon ACM DBLP
31 How to Sign Given Any Trapdoor Function (context) - Bellare, Micali - 1992 ACM DBLP
29 Incoercible Multiparty Computation - Canetti, Gennaro - 1996 ACM
28 An optimal probabilistic protocol for synchronous Byzantine .. (context) - Feldman, Micali - 1997 ACM DBLP
28 the Cryptographic Applications of Random Functions (context) - Goldreich, Goldwasser et al. - 1985
27 A Complete Promise Problem for Statistical Zero-Knowledge - Sahai, Vadhan - 1997 ACM DBLP
27 Deniable Encryption - Canetti, Dwork et al. ACM DBLP
27 Zero-Knowledge Simulation of Boolean Circuits - Brassard, Cr'epeau - 1987 ACM DBLP
26 An Efficient Existentially Unforgeable Signature Scheme and .. - Dwork, Naor
26 An Introduction to Threshold Cryptography (context) - Gemmell - 1997
25 Constant-Round Perfect Zero-Knowledge Computationally Convin.. - Brassard, Cr'epeau et al. - 1991 ACM DBLP
24 The Discrete Logarithm Modulo a Composite Hides O (context) - Hastad, Schrift et al. - 1993
24 Secure and Efficient Off-Line Digital Money - Franklin, Yung
23 Incremental Cryptography and Application to Virus Protection - Bellare, Goldreich et al. - 1995 ACM DBLP
23 Efficient and Secure Pseudo-Random Number Generation (context) - Vazirani, Vazirani - 1984 ACM DBLP
23 Stronger Security Proofs for RSA and Rabin Bits (context) - Fischlin, Schnorr - 1997 DBLP
22 Honest-Verifier Statistical Zero-Knowledge equals general St.. - Goldreich, Sahai et al. - 1997 ACM DBLP
21 Reconstructing Truncated Integer Variables Satisfying Linear.. (context) - Frieze, Hastad et al. - 1988 ACM DBLP
21 Why and How to Establish a Private Code in a Public Network (context) - Goldwasser, Micali et al. - 1982
20 An Efficient Non-Interactive Zero-Knowledge Proof System for.. - Kilian, Petrank DBLP
19 Security of Blind Digital Signatures (context) - Juels, Luby et al.
18 Limits on the Security of Coin Flips when Half the Processor.. (context) - Cleve - 1986 ACM
15 Unconditional security against memory-bounded adversaries - Cachin, Maurer ACM DBLP
15 Off-line Digital signatures (context) - Even, Goldreich et al. - 1996
14 Strong Signature Schemes (context) - Goldwasser, Micali et al. - 1983 ACM DBLP
14 An efficient algorithm for Byzantine Agreement without authe.. - Dolev, Fischer et al. - 1982 DBLP
14 On relationships between statistical zero-knowledge proofs - Okamoto - 1996 ACM DBLP
12 Visual Authentication and Identification - Naor, Pinkas ACM DBLP
12 A Simple Secure Unpredictable Pseudo-Random Number Generator (context) - Blum, Blum et al. - 1986
11 Pseudo-random (context) - Bellare, Goldwasser et al.
11 Fast distributed agreement (context) - Toueg, Perry et al. - 1987 ACM DBLP
10 Two Remarks Concerning the GMR Signature Scheme (context) - Goldreich - 1987
10 provably secure (context) - Pfitzmann, Waidner et al.
9 Inferring Sequences Produced by Pseudo-Random Number Generat.. (context) - Boyar - 1989 ACM DBLP
8 Efficient Cryptographic Protocols Based on Noisy Channels (context) - Cr'epeau DBLP
8 Journal of Cryptology (context) - Fiat - 1997
8 Zero-Knowledge Arguments for NP can be Based on General Assu.. (context) - Naor, Ostrovsky et al.
8 Direct Zero-Knowledge Computations (context) - Impagliazzo, Yung - 1987
8 A Note on the Complexity of Cryptography (context) - Brassard - 1979
7 How to Exchange Secret Keys (context) - Blum - 1983
6 An Efficient Pseudorandom Generator Provably as Secure as Sy.. - Fischer, Stern
6 Everything Provable is Probable in Zero-Knowledge (context) - Ben-Or, Goldreich et al. - 1990
5 How to Maintain Authenticated Communication in the Presence .. - Canetti, Halevi et al. - 1997
5 Properties of Payment Systems: General Definition Sketch and.. (context) - Pfitzmann, Waidner - 1996
5 Fault Tolerant Multi Party Computations: Past and Present (context) - Goldwasser - 1997
5 Rabin Functions: Certain Parts are As Hard As the Whole (context) - Alexi, Chor et al. - 1988
5 Linear Zero-Knowledge -- A Note on Efficient Zero-Knowledge .. - Cramer, Damgard - 1997
4 Honest Verifier vs Dishonest Verifier in Public Coin Zero-Kn.. - Damgard, Goldreich et al. - 1995
4 Quantum Information Processing: The Good (context) - Brassard
4 A Certified Digital Signature Scheme (context) - Merkle
3 Efficient and provable security amplifications - Cramer, Damgard et al. ACM DBLP
2 Cryptography and NP-Completeness (context) - Even, Yacobi - 1980
2 LCS Report TM (context) - Shamir, Rivest et al. - 1979
2 General Framework and Fail-Stop Signatures (context) - Pfitzmann, Schemes - 1996
2 Available from http ==theorylcmitedu= oded=fraghtml (context) - of, of et al. - 1995
2 Efficient Cryptographic Schemes Provable as Secure as Subset.. (context) - Impagliazzo, Naor - 1996
1 Cryptography in Transition (context) - Lempel - 1979
1 Based on several earlier work (context) - Pedersen, Pfitzmann et al. - 1997
1 Available from http ==theorylcmitedu= oded=lnhtml (context) - Notes, Signatures et al. - 1989
1 To appear in 30th ACM Symposium on the Theory of Computing (context) - Canetti, Goldreich et al. - 1998
1 Tentative title: Using one-way functions to construct Hash F.. (context) - Canetti, Micciancio - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~oded/tfoc.html):
On the Foundations of Modern Cryptography - Goldreich (1997) (Correct)
Secure Multi-Party Computation - Goldreich (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC