Subscribe

Redondo Beach, California

Nov. 12, 2000 to Nov. 14, 2000

ISBN: 0-7695-0850-2

pp: 32

L. Trevisan , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA

S. Vadhan , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA

ABSTRACT

The standard notion of a randomness extractor is a procedure which converts any weak source of randomness into an almost uniform distribution. The conversion necessarily uses a small amount of pure randomness, which can be eliminated by complete enumeration in some, but not all, applications. We consider the problem of deterministically converting a weak source of randomness into an almost uniform distribution. Previously, deterministic extraction procedures were known only for sources satisfying strong independence requirements. We look at sources which are samplable, i.e. can be generated by an efficient sampling algorithm. We seek an efficient deterministic procedure that, given a sample from any samplable distribution of sufficiently large min-entropy, gives an almost uniformly distributed output. We explore the conditions under which such deterministic extractors exist. We observe that no deterministic extractor exists if the sampler is allowed to use more computational resources than the extractor. On the other hand, if the extractor is allowed (polynomially) more resources than the sampler, we show that deterministic extraction becomes possible. This is true unconditionally in the nonuniform setting (i.e., when the extractor can be computed by a small circuit), and (necessarily) relies on complexity assumptions in the uniform setting.

INDEX TERMS

random processes; computational complexity; samplable distributions; randomness extractor; almost uniform distribution; deterministic extraction procedures; sampling algorithm; min-entropy; complexity

CITATION

L. Trevisan,
S. Vadhan,
"Extracting randomness from samplable distributions",

*FOCS*, 2000, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2000, pp. 32, doi:10.1109/SFCS.2000.892063