Metraipolis › archive › dc_fc00e361fca0
Multiplicative and Additive Extractors for Low Entropy Samplable Sources Under Reduced Assumptions — arXiv:2611.07829
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07829
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:54:32.134Z
- SHA-256 of the archived text
95e06b7f7a1d830e54cd20ac1bd95cd2bb0f2d127d961ba5c9c22d2bc30af339- Stable URL of this page
https://metraipolis.com/documento/dc_fc00e361fca0
How to cite
Multiplicative and Additive Extractors for Low Entropy Samplable Sources Under Reduced Assumptions — arXiv:2611.07829 — arXiv (en), https://arxiv.org/abs/2611.07829 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fc00e361fca0 (Metraipolis archive dc_fc00e361fca0, sha256 95e06b7f7a1d830e54cd20ac1bd95cd2bb0f2d127d961ba5c9c22d2bc30af339)
BibTeX
@misc{dcfc00e361fca0,
title = {Multiplicative and Additive Extractors for Low Entropy Samplable Sources Under Reduced Assumptions — arXiv:2611.07829},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07829},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fc00e361fca0; sha256 95e06b7f7a1d830e54cd20ac1bd95cd2bb0f2d127d961ba5c9c22d2bc30af339},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07829. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Trevisan and Vadhan [TV, FOCS'00] constructed (seedless) extractors for distributions samplable by poly-size circuits that have very high min-entropy, under the very strong complexity theoretic hardness assumption that $\mathsf{E}=\mathsf{DTIME}(2^{O(n)})$ requires size $2^{\Omega(n)}$ circuits that have oracle access to $\Sigma_6^{\text{P}}$. In this paper we give three new explicit constructions of extractors for samplable distributions. First, we construct an extractor that extracts one bit, with constant error, for min-entropy $k=O(\log n)$, which matches the non-constructive probabilistic argument. This result uses hardness for nondeterministic circuits, and achieves the same parameters as the recent extractor of Oh and Shaltiel [OS, STOC'26] under an incomparable hardness assumption. In contrast to the extractor of [OS26], our extractor (and, similarly, the constructions below) also works for the more general class of distributions samplable with postselection (a model introduced by [BGDM, FOCS'23] that generalizes samplable and recognizable sources). Second, we construct an extractor that extracts almost all the entropy, with polynomially small error, for min-entropy $k=n^{\alpha}$, where $\alpha>0$ is an arbitrary constant. This result also uses hardness for nondeterministic circuits, and significantly improves upon the recent extractor of [Shaltiel, FOCS'25] which required a much stronger assumption. This extractor is also \textit{multiplicative}: a stronger notion suggested in [AASY, Comp. Complexity'16; Shaltiel, CCC'25] to make extractors for samplable distributions suitable for selecting keys for cryptographic protocols. Third, we construct an extractor that extracts almost all the entropy, with polynomially small error, for min-entropy $k=\mathrm{polylog}(n)$. This result uses hardness for circuits that have oracle access to $\Sigma_2^{\text{P}}$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.CC, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2611.07829 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:27:27.633Z dalla pagina https://arxiv.org/list/cs.CC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).