@article {IOPORT.06014330,
    author       = {Ben-Aroya, Avraham and Ta-Shma, Amnon},
    title        = {Better short-seed quantum-proof extractors.},
    year         = {2012},
    journal      = {Theoretical Computer Science},
    volume       = {419},
    issn         = {0304-3975},
    pages        = {17-25},
    publisher    = {Elsevier Science Publishers, Amsterdam},
    doi          = {10.1016/j.tcs.2011.11.036},
    abstract     = {Summary: We construct a strong extractor against quantum storage that works for every min-entropy $k$, has logarithmic seed length, and outputs $\varOmega (k)$ bits, provided that the quantum adversary has at most $\beta k$ qubits of memory, for any $\beta < \frac 12$. The construction works by first condensing the source (with minimal entropy-loss) and then applying an extractor that works well against quantum adversaries when the source is close to uniform. We also obtain an improved construction of a strong quantum-proof extractor in the high min-entropy regime. Specifically, we construct an extractor that uses a logarithmic seed length and extracts $\varOmega (n)$ bits from any source over $\{0,1\}^n$, provided that the min-entropy of the source conditioned on the quantum adversary’s state is at least $(1-\beta)n$, for any $\beta < \frac 12$.},
    identifier   = {06014330},
}