Randomness conservation inequalities; information and independence in mathematical theories
Information and Control
On the Generation of Cryptographically Strong Pseudo-Random Sequences
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Probabilistic encryption: theory and applications (partial information, factoring, pseudo random bit generation)
How to construct random functions
Journal of the ACM (JACM)
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A pseudo-random bit generator based on elliptic logarithms
Proceedings on Advances in cryptology---CRYPTO '86
How to sign given any trapdoor function
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the theory of average case complexity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
How to sign given any trapdoor function
CRYPTO '88 Proceedings on Advances in cryptology
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
How to construct pseudorandom permutations from single pseudorandom functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Being taught can be faster than asking questions
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Proceedings of the 4th ACM conference on Computer and communications security
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Shared generation of pseudo-random functions
Journal of Complexity - Special issue on coding and cryptography
An efficient pseudo-random generator provably as secure as syndrome decoding
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Towards a separation of semantic and CCA security for public key encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
A message recognition protocol based on standard assumptions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Notes on Levin's theory of average-case complexity
Studies in complexity and cryptography
Pseudorandom generators with long stretch and low locality from random local one-way functions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
One-way are those functions which are easy to compute, but hard to invert on a non-negligible fraction of instances. The existence of such functions with some additional assumptions was shown to be sufficient for generating perfect pseudorandom strings |Blum, Micali 82|, |Yao 82|, |Goldreich, Goldwasser, Micali 84|. Below, among a few other observations, a weaker assumption about one-way functions is suggested, which is not only sufficient, but also necessary for the existence of pseudorandom generators. The main theorem can be understood without reading the sections 3-6.