Evaluation may be easier than generation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computational sample complexity
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
High-Speed Pseudorandom Number Generation with Small Memory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Pseudorandom function tribe ensembles based on one-way permutations: improvements and applications
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient broadcast encryption with personalized messages
ProvSec'10 Proceedings of the 4th international conference on Provable security
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
From non-adaptive to adaptive pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Hardness preserving constructions of pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Correlated product security from any one-way function
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
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 present a new cryptographic primitive called pseudo-random synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function. We show an NC/sup 1/ implementation of pseudo-random synthesizers based on the RSA or the Diffie-Hellman assumptions. This yields the first parallel (NC/sup 2/) pseudo-random function and the only alternative to the original construction of Goldreich, Gold-wasser and Micali (GGM). The security of our constructions is similar to the security of the underling assumptions. We discuss the connection with problems in computational learning theory.