Description:
In this work we show how to deterministically extract high quality randomness from several independent sources of low quality randomness.
We construct an extractor that can extract from a constant (c) number of independent sources of length n (N = 2^n), each of which have min-entropy that is polynomially small in n (say n^delta for some arbitrarily small constant delta). Our extractor is built by composing previous constructions of strong seeded extractors in simple ways. We introduce a new technique to condense somewhere random sources that seems like a useful way to manipulate independent sources.
Speaker(s):
Anup Rao, Institute For Advanced Study, University of Texas at Austin
|
