Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Efficiency considerations in using semi-random sources
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Combinatorica - Theory of Computing
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Journal of Computer and System Sciences
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
Privacy Amplification Secure Against Active Adversaries
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Extracting randomness from samplable distributions
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
Exposure-resilient cryptography
Exposure-resilient cryptography
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Extractors with weak random seeds
Proceedings of the thirty-seventh 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
How to Get More Mileage from Randomness Extractors
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography
SIAM Journal on Computing
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed
SIAM Journal on Computing
Extracting Randomness Using Few Independent Sources
SIAM Journal on Computing
Random Structures & Algorithms
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Random polynomial time is equal to slightly-random polynomial time
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Randomness-efficient oblivious sampling
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Exposure-resilient functions and all-or-nothing transforms
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Generalized strong extractors and deterministic privacy amplification
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Extractors and lower bounds for locally samplable sources
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Improving the Hadamard extractor
Theoretical Computer Science
| Hi-index | 0.00 |
We give polynomial-time, deterministic randomness extractors for sources generated in small space, where we model space s sources on {0,1}^n as sources generated by width 2^s branching programs. Specifically, there is a constant @h0 such that for any @zn^-^@h, our algorithm extracts m=(@d-@z)n bits that are exponentially close to uniform (in variation distance) from space s sources with min-entropy @dn, where s=@W(@z^3n). Previously, nothing was known for @d=