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
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SIGACT news complexity theory column 38
ACM SIGACT News
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
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)
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Extractors from Reed-Muller codes
Journal of Computer and System Sciences - Special issue on FOCS 2001
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)
Rearrangeable and nonblocking [w, f] -distributors
IEEE/ACM Transactions on Networking (TON)
Towards True Random Number Generation in Mobile Environments
NordSec '09 Proceedings of the 14th Nordic Conference on Secure IT Systems: Identity and Privacy in the Internet Age
A linear lower bound on the communication complexity of single-server private information retrieval
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Information and Computation
Short Seed Extractors against Quantum Storage
SIAM Journal on Computing
Better short-seed quantum-proof extractors
Theoretical Computer Science
Optimization problems in the polynomial-time hierarchy
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
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
Public-Key encryption in the bounded-retrieval model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Robust fuzzy extractors and authenticated key agreement from close secrets
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Polynomial time checking for generation of finite distributions of rational probabilities
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Design extractors, non-malleable condensers and privacy amplification
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We give an efficient algorithm to extract randomness from a very weak random source using a small additional number t of truly random bits. Our work extends that of Nisan and Zuckerman [ J. Comput. System Sci., 52 (1996), pp. 43--52] in that t remains small even if the entropy rate is well below constant. A key application of this is in running randomized algorithms using such a very weak source of randomness. For any fixed $\gamma 0$, we show how to simulate RP algorithms in time $n^{O(\log n)}$ using the output of a \ds\ with min-entropy $R^\gamma$. Such a weak random source is asked once for $R$ bits; it outputs an $R$-bit string according to any probability distribution that places probability at most $2^{-R^\gamma}$ on each string. If $\gamma 1/2$, our simulation also works for BPP; for $\gamma 1-1/(k+1)$, our simulation takes time $n^{O(\logk n)}$ (log(k) is the logarithm iterated k times). We also give a polynomial-time BPP simulation using Chor--Goldreich sources of min-entropy $R^{\Omega(1)}$, which is optimal. We present applications to time-space tradeoffs, expander constructions, and to the hardness of approximation. Of independent interest is our randomness-efficient Leftover Hash Lemma, a key tool for extracting randomness from weak random sources.