Tiny families of functions with random properties: a quality-size trade-off for hashing

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

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

Uniform hashing in constant time and linear space

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Hardness of Approximating Minimization Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

The PCP theorem by gap amplification

Journal of the ACM (JACM)

Embedding and similarity search for point sets under translation

Proceedings of the twenty-fourth annual symposium on Computational geometry

On Pseudorandom Generators with Linear Stretch in NC0

Computational Complexity

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)

How many oblivious transfers are needed for secure multiparty computation?

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology

A sample of samplers: a computational perspective on sampling

Studies in complexity and cryptography

Cryptography in constant parallel time

Cryptography in constant parallel time

Short Seed Extractors against Quantum Storage

SIAM Journal on Computing

Kakeya Sets, New Mergers, and Old Extractors

SIAM Journal on Computing

On beating the hybrid argument

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

Reliable computations based on locally decodable codes

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Better short-seed quantum-proof extractors

Theoretical Computer Science

On the error parameter of dispersers

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

Entropic security and the encryption of high entropy messages

TCC'05 Proceedings of the Second international conference on Theory of Cryptography

On pseudorandom generators with linear stretch in NC0

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Social sampling

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining

From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking

Journal of the ACM (JACM)

Pseudorandom generators for combinatorial checkerboards

Computational Complexity