How to construct random functions
Journal of the ACM (JACM)
On the cryptographic applications of random functions
Proceedings of CRYPTO 84 on Advances in cryptology
Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Two remarks concerning the Goldwasser-Micali-Rivest signature scheme
Proceedings on Advances in cryptology---CRYPTO '86
One-way functions and Pseudorandom generators
Combinatorica - Theory of Computing
Pseudo-random functions and factoring (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Indistinguishability of Random Systems
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Synthesizers and their application to the parallel construction of pseudo-random functions
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
How to generate cryptographically strong sequences of pseudo random bits
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
Proceedings of the 16th ACM conference on Computer and communications security
Algebraic pseudorandom functions with improved efficiency from the augmented cascade
Proceedings of the 17th ACM conference on Computer and communications security
The security of triple encryption and a framework for code-based game-playing proofs
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Pseudorandom functions and lattices
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Hardness preserving reductions via cuckoo hashing
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(logq) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting from an exponentially secure PRG {0,1}n ↦{0,1}2n, we get a PRF which is exponentially secure if queried at most q = exp(√n) times and where each invocation of the PRF requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n) required by known constructions.