Moni Naor, Omer Reingold  Home/Search
Context Related
Links: ACM DBLP | wisdom.weizmann.ac.il/~rein...gdh.ps.gz wisdom.weizmann.ac.il/~naor...gdh.ps.gz 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: wisdom.weizmann.ac.il/...research (more) From: cryptosoft.com/html/secpub (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe efficient constructions for various cryptographic primitives (both in privatekey and in public-key cryptography). We show these constructions to be at least as secure as the decisional version of the Diffie-Hellman assumption or as the assumption that factoring is hard. Our major result is a new construction of pseudo-random functions such that computing their value at any given point involves two multiple products. This is much more efficient than previous proposals. Furthermore,... (Update)
Cited by: More
Earlier versions of of this work appear in [9] and [1].. - Dhies An Encryption (Correct)
Practical Threshold Signatures - Shoup (1999) (Correct)
DHAES: An Encryption Scheme Based on the Diffie-Hellman.. - Abdalla, Bellare, Rogaway (1999) (Correct)
Similar documents (at the sentence level):
49.4%: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
38.2%: Number-Theoretic Constructions of Efficient Pseudo-Random.. - Naor, Reingold (1997) (Correct)
Active bibliography (related documents): More All
1.6: Synthesizers and Their Application to the Parallel.. - Naor, Reingold (1995) (Correct)
0.7: From Unpredictability to Indistinguishability: A Simple.. - Naor, Reingold (1998) (Correct)
0.7: From Unpredictability to Indistinguishability: A Simple.. - Moni Naor, Omer Reingold (Correct)
Similar documents based on text: More All
0.6: Pseudo-Random Functions and Factoring - Naor, Reingold (2000) (Correct)
0.5: Efficient Construction of (Distributed) Verifiable Random Functions - Dodis (2002) (Correct)
0.4: Efficient Cryptographic Schemes Provably as Secure as Subset Sum - Impagliazzo, Naor (1996) (Correct)
Related documents from co-citation: More All
19: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
18: How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1984
17: New directions in cryptography - Diffie, Hellman - 1976
BibTeX entry: (Update)
M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, 1997. http://citeseer.ist.psu.edu/article/naor97numbertheoretic.html More
@inproceedings{ naornumbertheoretic,
author = "Moni Naor and Omer Reingold",
title = "Number-Theoretic Constructions of Efficient Pseudo-Random Functions",
pages = "458--467",
url = "citeseer.ist.psu.edu/article/naor97numbertheoretic.html" }
Citations (may not include all citations):635 New directions in cryptography - Diffie, Hellman - 1976 ACM
601 A public-key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985
537 A theory of the learnable (context) - Valiant - 1984 ACM DBLP
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986 ACM DBLP
334 How to generate cryptographically strong sequence of pseudo-.. (context) - Blum, Micali - 1984
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984 ACM DBLP
184 Cryptographic limitations on learning Boolean formulae and f.. - Kearns, Valiant - 1994 ACM DBLP
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989 ACM DBLP
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997
112 Efficient identification and signatures for smart cards (context) - Schnorr - 1990 ACM DBLP
91 Log depth circuits for division and related problems (context) - Beame, Cook et al. - 1986 ACM DBLP
89 Fast exponentiation with precomputation (context) - Brickell, Gordon et al. - 1992
82 When won't membership queries help (context) - Angluin, Kharitonov - 1995
77 the construction of pseudo-random permutations: Luby-Rackoff.. - Naor, Reingold - 1997
72 How to share a function securely (context) - De Santis, Desmedt et al. - 1994 ACM DBLP
66 Constant depth circuits (context) - Linial, Mansour et al. - 1993
63 An efficient probabilistic public-key encryption scheme whic.. (context) - Blum, Goldwasser - 1984 DBLP
59 Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1990
56 Diffie-Hellman key distribution extended to group communicat.. - Steiner, Tsudik et al. - 1996 ACM DBLP
55 Hardness of computing most significant bits in secret keys i.. (context) - Boneh, Venkatesan - 1996
54 Checking the correctness of memories - Blum, Evans et al. - 1994 ACM DBLP
52 An efficient off-line electronic cash system based on the re.. - Brands - 1993
51 On threshold circuits and polynomial computation - Reif - 1987 ACM DBLP
51 On threshold circuits and polynomial computation - Reif, Tate - 1992 ACM DBLP
48 A key distribution system equivalent to factoring (context) - McCurley - 1988 ACM DBLP
39 Algorithms for Black-Box fields and their application to cry.. (context) - Boneh, Lipton - 1996
39 Advances in Cryptology - CRYPTO (context) - Chor, Fiat et al. - 1994
32 on Foundations of Computer Science (context) - Yao, applications et al. - 1982
32 Synthesizers and their application to the parallel construct.. - Naor, Reingold - 1995 ACM DBLP
31 Cryptographic hardness of distribution-specific learning (context) - Kharitonov - 1993 ACM DBLP
31 Cryptographic primitives based on hard learning problems - Blum, Furst et al. - 1994 ACM DBLP
29 Towards the equivalence of breaking the Diffie-Hellman proto.. - Maurer - 1994
28 the cryptographic applications of random functions (context) - Goldreich, Goldwasser et al. - 1985
26 Two remarks concerning the Goldwasser-Micali-Rivest signatur.. - Goldreich - 1987 ACM DBLP
25 On optimal depth threshold circuits for multiplication and r.. (context) - Siu, Roychowdhury - 1994
25 Pseudo-randomness and applications (context) - Luby - 1996
24 Depth efficient neural network for division and related prob.. (context) - Siu, Bruck et al. - 1993
23 How to construct pseudorandom permutations and pseudorandom .. (context) - Luby, Rackoff - 1988
23 Advances in Cryptology - CRYPTO (context) - Chaum, van Antwerpen et al. - 1990
18 Advances in Cryptology - CRYPTO (context) - Bellare, Goldwasser et al. - 1990
16 Electronic publication: http://www (context) - Goldreich, Cryptography et al. - 1995
15 Composite Diffie-Hellman public-key generating systems are h.. (context) - Shmuely - 1985
13 Joint encryption and message-efficient secure computation (context) - Franklin, Haber - 1996
12 A simple secure unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986
10 Breaking generalized Diffie-Hellman modulo a composite is no.. - Biham, Boneh et al. ACM
10 Discrete logarithms and smooth polynomials - Odlyzko - 1993
7 Modern cryptology (context) - Brassard - 1988 ACM
7 th IEEE Symposium on Foundations of Computer Science (context) - Impagliazzo, Zuckerman et al. - 1989
6 An efficient software protection scheme (context) - Ostrovsky - 1990 ACM DBLP
6 On certain exponential sums and the distribution of Diffie-H.. - Canetti, Friedlander et al. - 1997
5 Towards a theory of software protection (context) - Goldreich - 1987 ACM DBLP
2 AMS Lecture Notes (context) - McCurley, logarithm et al. - 1990
2 Efficient Cryptographic schemes provably secure as subset su.. (context) - Impagliazzo, Naor - 1996
1 realizing Towards realizing random oracles: hash functions t.. (context) - Canetti - 1997
1 A PSRG based on the decision Diffie-Hellman assumption (context) - Gertner, Malkin - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.wisdom.weizmann.ac.il/~reingold/research.html): More
Perfectly One-Way Probabilistic Hash Functions - Canetti, Micciancio, Reingold (1998) (Correct)
From Unpredictability to Indistinguishability: A Simple.. - Naor, Reingold (1998) (Correct)
On the Construction of Pseudo-Random Permutations.. - Moni Naor, Omer Reingold (1997) (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