An introduction to randomness extractors

Authors:
Ronen Shaltiel
Affiliations:
University of Haifa
Venue:
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Year:
2011

Citing 57
Cited 1

Generating quasi-random sequences from semi-random sources

Journal of Computer and System Sciences
Independent unbiased coin flips from a correlated biased source:80a finite state Markov chain

Combinatorica
Deterministic simulation in LOGSPACE

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficiency considerations in using semi-random sources

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity

SIAM Journal on Computing - Special issue on cryptography
Hardness vs randomness

Journal of Computer and System Sciences
Eigenvalues and expansion of regular graphs

Journal of the ACM (JACM)
Randomness is linear in space

Journal of Computer and System Sciences
Explicit OR-dispersers with polylogarithmic degree

Journal of the ACM (JACM)
Randomness-optimal oblivious sampling

Proceedings of the workshop on Randomized algorithms and computation
A Chernoff Bound for Random Walks on Expander Graphs

SIAM Journal on Computing
Extracting randomness: a survey and new constructions

Journal of Computer and System Sciences
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators

SIAM Journal on Discrete Mathematics
Extractors and pseudorandom generators

Journal of the ACM (JACM)
Randomness conductors and constant-degree lossless expanders

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors

Journal of Computer and System Sciences - STOC 1999
Extractors: optimal up to constant factors

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Extracting randomness from samplable distributions

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Simple extractors for all min-entropies and a new pseudorandom generator

Journal of the ACM (JACM)
Extractors with weak random seeds

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Extractors from Reed-Muller codes

Journal of Computer and System Sciences - Special issue on FOCS 2001
Constructing Ramsey Graphs from Boolean Function Representations

CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Lossless Condensers, Unbalanced Expanders, And Extractors

Combinatorica
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography

SIAM Journal on Computing
Algorithmic results in list decoding

Foundations and Trends® in Theoretical Computer Science
The unified theory of pseudorandomness: guest column

ACM SIGACT News
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
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
How to get more mileage from randomness extractors

Random Structures & Algorithms
Increasing the Output Length of Zero-Error Dispersers

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
Extractors for Three Uneven-Length Sources

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
Deterministic extractors for affine sources over large fields

Combinatorica
Network Extractor Protocols

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Extractors And Rank Extractors For Polynomial Sources

Computational Complexity
Affine dispersers from subspace polynomials

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)
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach
Extractors for Low-Weight Affine Sources

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Extractors for Varieties

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
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
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources

SIAM Journal on Computing
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors

Journal of the ACM (JACM)
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Simple Affine Extractors Using Dimension Expansion

CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Deterministic extractors for small-space sources

Journal of Computer and System Sciences
From affine to two-source extractors via approximate duality

Proceedings of the forty-third annual ACM symposium on Theory of computing
Improved Constructions of Three Source Extractors

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
A New Approach to Affine Extractors and Dispersers

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Generalized strong extractors and deterministic privacy amplification

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Extractor codes

IEEE Transactions on Information Theory

Extractors and Lower Bounds for Locally Samplable Sources

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an introduction to the area of "randomness extraction" and survey the main concepts of this area: deterministic extractors, seeded extractors and multiple sources extractors. For each one we briefly discuss background, definitions, explicit constructions and applications.