Moni Naor, Omer Reingold  Home/Search
Context Related
Links: ACM DBLP | wisdom.weizmann.ac.il/users...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/u...gdh_abs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe efficient constructions for various cryptographic primitives in private-key as well as public-key cryptography. Our major results are two new constructions of pseudorandom functions. We prove the pseudo-randomness of one construction under the assumption that factoring (Blum integers) is hard while the other construction is pseudo-random if the decisional version of the Diffie-Hellman assumption holds. Computing the value of our functions at any given point involves two subset... (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):
31.6%: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
30.2%: Number-Theoretic Constructions of Efficient Pseudo-Random.. - Naor, Reingold (1997) (Correct)
Active bibliography (related documents): More All
0.7: Computationally Secure Oblivious Transfer - Naor, Pinkas (1999) (Correct)
0.6: Synthesizers and Their Application to the Parallel.. - Naor, Reingold (1995) (Correct)
0.5: On the minimal Hardware Complexity of Pseudorandom Function.. - Krause, Lucks (2000) (Correct)
Similar documents based on text: More All
0.9: Pseudo-Random Functions and Factoring - Naor, Reingold (2000) (Correct)
0.5: Efficient Construction of (Distributed) Verifiable Random Functions - Dodis (2002) (Correct)
0.3: Completeness in Two-Party Secure Computation Revisited - Harnik, Naor, Reingold, Rosen (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/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/naor97numbertheoretic.html" }
Citations (may not include all citations):645 How to share a secret (context) - Shamir ACM DBLP
635 New directions in cryptography - Die, 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
287 Multiparty unconditionally secure protocols (context) - Chaum, Crepeau et al. - 1988 ACM
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984 ACM DBLP
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998 ACM DBLP
250 How to play any mental game (context) - Goldreich, Micali et al. - 1987 ACM
219 Completeness theorems for non-cryptographic fault tolerant d.. (context) - Ben-Or, Goldwasser et al. - 1988
184 Cryptographic limitations on learning Boolean formulae and n.. - Kearns, Valiant - 1994
166 Wallet databases with observers (context) - Chaum, Pederson - 1992 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 DBLP
124 Bit commitment using pseudorandomness - Naor - 1991 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
85 Construction of a pseudo-random generator from any one-way f.. - Hastad, Impagliazzo et al. - 1999
82 When won't membership queries help (context) - Angluin, Kharitonov - 1995
77 the construction of pseudo-random permutations: Luby-Racko .. - Naor, Reingold - 1999
66 Constant depth circuits (context) - Linial, Mansour et al. - 1993
59 Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1990 ACM
57 Software Protection and Simulation on Oblivious RAMs - Goldreich, Ostrovsky - 1996 ACM DBLP
54 Checking the correctness of memories - Blum, Evans et al. - 1994 ACM DBLP
51 On threshold circuits and polynomial computation - Reif - 1987 ACM DBLP
51 On threshold circuits and polynomial computation - Reif, Tate - 1992 ACM DBLP
48 line electronic cash system based on the representation prob.. (context) - Brands, ecient - 1993
48 A key distribution system equivalent to factoring (context) - McCurley - 1988 ACM DBLP
42 How to share a function securely (context) - De Santis, Desmedt et al. - 1994 ACM DBLP
42 Towards realizing random oracles: hash functions that hide a.. - Canetti - 1997 DBLP
39 Advances in Cryptology - CRYPTO (context) - Chor, Fiat et al. - 1994
34 Proofs of Partial Knowledge and Simplied Design of Witness H.. - Cramer, Damg 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 - 1999 ACM DBLP
31 Cryptographic primitives based on hard learning problems - Blum, Furst et al. - 1994 ACM DBLP
28 the cryptographic applications of random functions (context) - Goldreich, Goldwasser et al. - 1985
26 Distributed Pseudo-Random Functions and KDCs - Naor, Pinkas et al. - 1999 DBLP
26 Publicly veriable secret sharing - Stadler - 1996
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 Ecient identication and signatures for smart cards (context) - Schnorr - 1990
23 Advances in Cryptology - CRYPTO (context) - Chaum, van Antwerpen et al. - 1990
23 How to construct pseudorandom permutations and pseudorandom .. (context) - Luby, Racko - 1988
18 Advances in Cryptology - CRYPTO (context) - Bellare, Goldwasser et al. - 1990
17 Die-Hellman key distribution extended to group communication (context) - Steiner, Tsudik et al. - 1996
16 Electronic publication: http://www (context) - Goldreich, Cryptography et al. - 1995
16 Advances in Cryptology - CRYPTO (context) - Desmedt, group et al. - 1987
16 Advances in Cryptology { CRYPTO (context) - Desmedt, Frankel et al. - 1989
16 Towards the equivalence of breaking the Die-Hellman protocol.. (context) - Maurer, Wolf - 1999
14 Joint encryption and message-ecient secure computation (context) - Franklin, Haber - 1996
12 Hardness of computing most signicant bits in secret keys in .. (context) - Boneh, Venkatesan - 1996
12 A simple secure unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986
12 Algorithms for Black-Box elds and their application to crypt.. (context) - Boneh, Lipton - 1996
11 Breaking generalized Die-Hellman modulo a composite is no ea.. (context) - Biham, Boneh et al.
10 Discrete logarithms and smooth polynomials - Odlyzko - 1993
7 Modern cryptology (context) - Brassard - 1988 ACM
7 An ecient probabilistic public-key encryption scheme which h.. (context) - Blum, Goldwasser - 1984
7 Cryptographic hardness of distribution-specic learning (context) - Kharitonov - 1993
7 th IEEE Symposium on Foundations of Computer Science (context) - Impagliazzo, Zuckerman et al. - 1989
6 Advances in Cryptology - EUROCRYPT (context) - Naor, Pinkas et al. - 1998
2 of Computer and System Sciences (context) - Razborov, Rudich et al. - 1997
2 Depth ecient neural network for division and related problem.. (context) - Siu, Bruck et al. - 1993
2 Ecient Cryptographic schemes provably secure as subset sum (context) - Impagliazzo, Naor - 1996
2 AMS Lecture Notes (context) - McCurley, logarithm et al. - 1990
2 private communication (context) - Pinkas
2 Composite Die-Hellman public-key generating systems are hard.. (context) - Shmuely - 1985
1 An implementation of ecient pseudo-random functions (context) - Langberg - 1998
1 and A. Rosen, Pseudo-random functions and Factoring, Proc. 3.. (context) - Naor, Reingold - 2000
1 st ACM Symp (context) - Naor, Pinkas et al. - 1999
1 A PSRG based on the decision Die-Hellman assumption (context) - Gertner, Malkin - 1997
The graph only includes citing articles where the year of publication is known.
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