Moni Naor, Omer Reingold  Home/Search
Context Related
Links: ACM DBLP | wisdom.weizmann.ac.il/~rei...synt.ps.gz wisdom.weizmann.ac.il/~nao...synt.ps.gz wisdom.weizmann.ac.il/home...synt.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 From: wisdom.weizmann.ac.il/...research (more) From: cryptosoft.com/html/secpub (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A pseudo-random function is a fundamental cryptographic primitive that is essential for encryption, identification and authentication. We present a new cryptographic primitive called pseudorandom synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function. We show several NC 1 implementations of synthesizers based on concrete intractability assumptions as factoring and the Diffie-Hellman assumption. This yields the first parallel pseudorandom... (Update)
Context of citations to this paper: More
...to exponentially many of its bits. 2.1. 3 The NR Constructions About a decade after the GGM paper appeared, Naor and Reingold (NR) [19] suggested a parallel construction of pseudorandom functions. The NR construction was obtained by introducing a new cryptographic...
.... any one way function [10] Recently a different construction of pseudorandom function families from trapdoor functions was proposed [14]. In these works pseudorandom function families are regarded as a compound primitive, whereas oneway functions (or trapdoor functions) are...
Cited by: More
From Known-Plaintext to Chosen-Ciphertext Security - Maurer, Sjödin (2006) (Correct)
On the Construction of Pseudo-Random Permutations.. - Naor, Reingold (1996) (Correct)
Computational Sample Complexity - Decatur, Goldreich, Ron (1998) (Correct)
Similar documents (at the sentence level):
71.9%: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
Active bibliography (related documents): More All
1.6: Number-Theoretic Constructions of Efficient Pseudo-Random.. - Naor, Reingold (1997) (Correct)
0.5: From Unpredictability to Indistinguishability: A Simple.. - Naor, Reingold (1998) (Correct)
0.5: From Unpredictability to Indistinguishability: A Simple.. - Moni Naor, Omer Reingold (Correct)
Similar documents based on text: More All
0.8: Pseudo-Random Functions and Factoring - Naor, Reingold (2000) (Correct)
0.4: Rigorous Time/Space Tradeoffs for Inverting Functions - Fiat, Naor (2000) (Correct)
Related documents from co-citation: More All
25: How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1984
18: How to generate cryptographically strong sequences of pseudorandom bits (context) - Blum, Micali - 1984
12: Pseudo-randomness and applications (context) - Luby - 1996
BibTeX entry: (Update)
M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions, Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 170-181. http://citeseer.ist.psu.edu/104828.html More
@article{ naor95synthesizers,
author = "Moni Naor and Omer Reingold",
title = "Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "2",
number = "045",
year = "1995",
url = "citeseer.ist.psu.edu/104828.html" }
Citations (may not include all citations):1529 A method for obtaining digital signature and public key cryp.. - Rivest, Shamir et al. - 1978
635 New directions in cryptography - Diffie, Hellman - 1976 ACM
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
268 Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990 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 DBLP
91 Log depth circuits for division and related problems (context) - Beame, Cook et al. - 1986 ACM DBLP
82 When won't membership queries help (context) - Angluin, Kharitonov - 1995
77 the construction of pseudo-random permutations: Luby-Rackoff.. - Naor, Reingold - 1997
68 One-way function and pseudorandom generators (context) - Levin - 1985
68 Pseudorandom generators for space-bounded computation (context) - Nisan - 1992 DBLP
66 Constant depth circuits (context) - Linial, Mansour et al. - 1993
62 RSA and Rabin functions: certain parts are as hard as the wh.. (context) - Alexi, Chor et al. - 1988 ACM DBLP
55 Number-Theoretic constructions of efficient pseudo-random fu.. - Naor, Reingold - 1997 ACM DBLP
49 Incremental cryptography: the case of hashing and signing - Bellare, Goldreich et al. - 1994 DBLP
48 A key distribution system equivalent to factoring (context) - McCurley - 1988 ACM DBLP
45 the generation of cryptographically strong pseudo-random num.. (context) - Shamir - 1983
39 Advances in Cryptology - CRYPTO (context) - Chor, Fiat et al. - 1994
39 Algorithms for Black-Box fields and their application to cry.. (context) - Boneh, Lipton - 1996
39 pseudorandom generators for logspace (context) - Babai, Nisan et al. - 1992
37 No better ways to generate hard NP instances than picking un.. (context) - Impagliazzo, Levin - 1990 DBLP
32 on Foundations of Computer Science (context) - Yao, applications et al. - 1982
31 Cryptographic primitives based on hard learning problems - Blum, Furst et al. - 1994 ACM DBLP
31 Cryptographic hardness of distribution-specific learning (context) - Kharitonov - 1993 ACM DBLP
29 How to generate factored random numbers (context) - Bach - 1988 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 Pseudo-randomness and applications (context) - Luby - 1996
24 The discrete logarithm modulo a composite hides O (context) - Hastad, Schrift et al. - 1993
23 Stronger security proofs for RSA and Rabin bits (context) - Fischlin, Schnorr - 1997 DBLP
23 How to construct pseudorandom permutations and pseudorandom .. (context) - Luby, Rackoff - 1988
20 New paradigms for digital signatures and message authenticat.. (context) - Bellare, Goldwasser - 1990 ACM
17 Lecture Notes in Computer Science (context) - Brassard, cryptology - 1988
16 Electronic publication: http://www (context) - Goldreich, Cryptography et al. - 1995
15 Composite Diffie-Hellman public-key generating systems are h.. (context) - Shmuely - 1985
12 A simple secure unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986
8 Efficient parallel pseudorandom number generation (context) - Reif, Tygar - 1988 ACM DBLP
8 Public randomness in cryptography - Herzberg, Luby - 1992
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
5 Incremental Cryptography with Application to Virus Protectio.. (context) - Bellare, Goldreich et al. - 1995
5 Towards a theory of software protection (context) - Goldreich - 1987 ACM DBLP
4 Generalized Diffie-Hellman modulo a composite is no easier t.. - Biham, Boneh et al.
3 Artin's conjecture for primitive roots (context) - Murty - 1988
2 Efficient Cryptographic schemes provably secure as subset su.. (context) - Impagliazzo, Naor - 1996
2 Complexity theoretic issues concerning block ciphers related.. (context) - Cleve - 1991
1 Methodologies for designing block ciphers and cryptographic .. (context) - Cleve - 1989 ACM
1 on Theory of Computing (context) - Nisan, SC et al. - 1992
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)
Number-Theoretic Constructions of Efficient Pseudo-Random.. - Naor, Reingold (1997) (Correct)
From Unpredictability to Indistinguishability: A Simple.. - Naor, Reingold (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