How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
| Hi-index | 0.00 |
The computational theory of pseudorandomness and cryptography.