Untitled

We introduce a new type of seeded extractors we dub seed-protecting extractors.Informally, a seeded extractor is seed protecting against a class of functions, mappings seeds to seeds, if the seed remains close to uniform even after observing the output Ext( , ( )) for every choice of (or, more generally, observing the outputs corresponding to several adversaries from ).The results of this paper are structural.We establish what we believe to be surprising relations, in fact, equivalences between seed-protecting extractors and each of the well-studied strengthenings of seeded extractors: strong extractors, nonmalleable extractors (albeit only against permutations), and two-source extractors, where each case is classified by a suitable class .Our work motivates the study of non-malleable extractors against permutations and puts forth a novel approach for their construction.Indeed, the existing machinery developed for constructing non-malleable extractors focuses on the output and so it is aimed towards breaking correlations.Instead, our work suggests developing techniques for protecting the seed.

Authors

Publication Details

Journal
Theory of Computing
Published
2025-01-01
DOI
https://doi.org/10.4086/toc.2025.v021a008
Primary Topic
DNA and Biological Computing
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Untitled

Shahar Samocha, Dean Doron
Theory of Computing
DNA and Biological Computing
article

Untitled

Shahar Samocha, Dean Doron
article en

Abstract

We introduce a new type of seeded extractors we dub seed-protecting extractors.Informally, a seeded extractor is seed protecting against a class of functions, mappings seeds to seeds, if the seed remains close to uniform even after observing the output Ext( , ( )) for every choice of (or, more generally, observing the outputs corresponding to several adversaries from ).The results of this paper are structural.We establish what we believe to be surprising relations, in fact, equivalences between seed-protecting extractors and each of the well-studied strengthenings of seeded extractors: strong extractors, nonmalleable extractors (albeit only against permutations), and two-source extractors, where each case is classified by a suitable class .Our work motivates the study of non-malleable extractors against permutations and puts forth a novel approach for their construction.Indeed, the existing machinery developed for constructing non-malleable extractors focuses on the output and so it is aimed towards breaking correlations.Instead, our work suggests developing techniques for protecting the seed.

Theory of ComputingVol. 21(1)
National Science Foundation
Openalex Percentile: Top 72%
DNA and Biological Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Untitled — Shahar Samocha, Dean Doron · Theory of Computing (2025) | TGRS Research Map | TGRS