How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Unapproximable Versions of NP-Complete Problems
SIAM Journal on Computing
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
Explicit OR-dispersers with polylogarithmic degree
Journal of the ACM (JACM)
A new general derandomization method
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Tiny families of functions with random properties: a quality-size trade-off for hashing
Proceedings of the workshop on Randomized algorithms and computation
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Extracting Randomness: How and Why - A survey
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Tight bounds for depth-two superconcentrators
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the distribution of the number of roots of polynomials and explicit weak designs
Random Structures & Algorithms
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Better extractors for better codes?
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Extractors for a constant number of polynomially small min-entropy independent sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Progress in computational complexity theory
Journal of Computer Science and Technology
Language compression and pseudorandom generators
Computational Complexity
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Extractors from Reed-Muller codes
Journal of Computer and System Sciences - Special issue on FOCS 2001
The unified theory of pseudorandomness: guest column
ACM SIGACT News
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
The complexity of the matroid–greedoid partition problem
Theoretical Computer Science
Short seed extractors against quantum storage
Proceedings of the forty-first annual ACM symposium on Theory of computing
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
Extracting Computational Entropy and Learning Noisy Linear Functions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Extractors Using Hardness Amplification
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Pseudorandom Generators and Typically-Correct Derandomization
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Capacity achieving codes from randomness conductors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Invertible extractors and wiretap protocols
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Simple extractors via constructions of cryptographic pseudo-random generators
Theoretical Computer Science
One-way permutations, interactive hashing and statistically hiding commitments
TCC'07 Proceedings of the 4th conference on Theory of cryptography
List decoding and pseudorandom constructions
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Noise-resilient group testing: limitations and constructions
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
Two-source extractors secure against quantum adversaries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Deterministic extractors for small-space sources
Journal of Computer and System Sciences
A lower bound on list size for list decoding
IEEE Transactions on Information Theory
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
ACM Transactions on Computation Theory (TOCT)
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Information and Computation
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Quantum-resilient randomness extraction
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Short Seed Extractors against Quantum Storage
SIAM Journal on Computing
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Simple extractors via constructions of cryptographic pseudo-random generators
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Better short-seed quantum-proof extractors
Theoretical Computer Science
A lower bound on list size for list decoding
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Reconstructive dispersers and hitting set generators
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Extracting kolmogorov complexity with applications to dimension zero-one laws
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Design extractors, non-malleable condensers and privacy amplification
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computational extractors and pseudorandomness
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Capacity achieving two-write WOM codes
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Dual projective hashing and its applications -- lossy trapdoor functions and more
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
| Hi-index | 0.13 |
We introduce a new approach to constructing extractors. Extractors are algorithms that transform a "e;weakly random"e; distribution into an almost uniform distribution. Explicit constructions of extractors have a variety of important applications, and tend to be very difficult to obtain.We demonstrate an unsuspected connection between extractors and pseudorandom generators. In fact, we show that every pseudorandom generator of a certain kind is an extractor.A pseudorandom generator construction due to Impagliazzo and Wigderson, once reinterpreted via our connection, is already an extractor that beats most known constructions and solves an important open question. We also show that, using the simpler Nisan--Wigderson generator and standard error-correcting codes, one can build even better extractors with the additional advantage that both the construction and the analysis are simple and admit a short self-contained description.