Exposure-resilient extractors and the derandomization of probabilistic sublinear time
There exists a positive constant alpha   {0, 1}(m) is a (k, is an element of)-exposure-resilient extractor resistant to q queries if, when the min-entropy of the random variable x is at least k and the random variable y is uniformly distributed, EXT(x, y) looks E-random to all statistical tests modeled by oracle circuits of unbounded size that can query q bits of x. Besides the extractor that is needed for the proof of the main result (whose parameters are tailored for this application), we construct, for any delta < 1, a polynomial-time computable (k, is an element of)-exposure-resilient extractor with query resistance n(delta), k = n - n(Omega(1)), is an element of = n(-Omega(1)), m = n(-Omega(1)) and d = O(log n).
extractor sublinear-time algorithm pseudo-random generator