Number-theoretic constructions of efficient pseudo-random functions

Number-theoretic constructions of efficient pseudo-random functions (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Moni Naor , Omer Reingold

Venue:	In 38th Annual Symposium on Foundations of Computer Science
Citations:	121 - 9 self

BibTeX

@INPROCEEDINGS{Naor97number-theoreticconstructions,
    author = {Moni Naor and Omer Reingold},
    title = {Number-theoretic constructions of efficient pseudo-random functions},
    booktitle = {In 38th Annual Symposium on Foundations of Computer Science},
    year = {1997},
    pages = {458--467}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

2292	New Directions in Cryptography - Diffie, Hellman - 1976
1515	A Theory of the Learnable - Valiant - 1984
1001	Probabilistic encryption - Goldwasser, Micali - 1984
961	A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm - ElGamal - 1985
601	A pseudorandom generator from any one-way function - H˚astad, Impagliazzo, et al. - 1999
544	How to construct random functions - Goldreich, Goldwasser, et al. - 1986
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
453	Theory and applications of trapdoor functions - Yao - 1982
432	Group Signatures - Chaum, Heijst - 1991
292	L.: A Hard-Core Predicate for all One-Way Functions - Goldreich, Levin - 1989
279	Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1994
262	Efficient Identification and Signatures for Smart Cards. CRYPTO - Schnorr - 1989
253	Constant Depth Circuits, Fourier Transform, and Learnability - Linial, Mansour, et al. - 1993
184	Lower bounds for discrete logarithms and related problems - Shoup - 1997
163	How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
155	Diffie-Hellman Key Distribution Extended to Group Communication - Steiner, Tsudik, et al. - 1996
152	Natural proofs - Razborov, Rudich - 1997
140	Foundations of cryptography (fragments of a book - Goldreich - 1995
125	An Efficient Off-Line Electronic Cash System Based on the Representation Problem - Brands - 1993
121	M.: Tracing traitors - Chor, Fiat, et al. - 1994
107	When won’t membership queries help - Angluin, Kharitonov - 1991
106	Log depth circuits for division and related problems - Beame, Cook, et al. - 1984
102	An efficient probabilistic public-key encryption scheme which hides all partial information - Blum, Goldwasser - 1985
92	Non-interactive Oblivious Transfer and Applications - Bellare, Micali - 1989
84	R.: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie–Hellman and Related Schemes - Boneh, Venkatesan - 1996
82	On the construction of pseudo-random permutations: Luby-Rackoff revisited - Naor, Reingold - 1999
80	Towards realizing random oracles: Hash functions that hide all partial information - Canetti - 1997
69	Cryptographic primitives based on hard learning problems - Blum, Furst, et al. - 1994
69	Algorithms for black box fields and their application to cryptography - Boneh, Lipton - 1996
69	Efficient cryptographic schemes provably as secure as subset sum - Impagliazzo, Naor - 1996
69	Cryptographic hardness of distribution-specific learning - Kharitonov - 1993
66	How to share a function securely - Santis, Desmedt, et al. - 1994
61	Fast exponentiation with precomputation - Brickell, Gordon, et al. - 1992
61	Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms - Maurer
51	A key distribution system equivalent to factoring - McCurley - 1988
48	On threshold circuits and polynomial computation - Reif, Tate - 1992
46	On the cryptographic applications of random functions - Goldreich, Goldwasser, et al. - 1985
36	Depth efficient neural networks for division and related problems - Siu, Bruck, et al. - 1993
35	Synthesizers and their application to the parallel construction of psuedo-random functions - Naor, Reingold - 1995
34	New paradigms for digital signatures and message authentication based on non-interative zero knowledge proofs - Bellare, Goldwasser - 1990
30	Joint encryption and message-efficient secure computation - Franklin, Haber - 1996
27	Two remarks concerning the Goldwasser-Micali-Rivest signature scheme - Goldreich - 1986
27	On optimal depth threshold circuits for multiplication and related problems - Siu, Rowchowdhury - 1994
25	On certain exponential sums and the distribution of Diffie-Hellman triples - Canetti, Friedlander, et al. - 1999
25	How to construct pseudorandom permutations and pseudorandom functions - Luby, Rackoff - 1988
20	Introduction to Modern Cryptology - Brassard - 1987
19	Composite Diffie-Hellman Public-Key Generating Systems are Hard to Break.” Computer science technical report 356 - Shmuely - 1985
18	Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring - Biham, Boneh, et al. - 1999
16	Pseudo-randomness and applications - Luby - 1996
14	Checking the correctness of memories. Algorithmica 12 - Blum, Evans, et al. - 1994