Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1801.03200

An Entropy Lower Bound for Non-Malleable Extractors

Tom Gur·Igor Shinkar
View original source ↗Read source document ↗Export metadata ↓

Abstract

A $(k,\varepsilon)$-non-malleable extractor is a function ${\sf nmExt} : \{0,1\}^n \times \{0,1\}^d \to \{0,1\}$ that takes two inputs, a weak source $X \sim \{0,1\}^n$ of min-entropy $k$ and an independent uniform seed $s \in \{0,1\}^d$, and outputs a bit ${\sf nmExt}(X, s)$ that is $\varepsilon$-close to uniform, even given the seed $s$ and the value ${\sf nmExt}(X, s')$ for an adversarially chosen seed $s' \neq s$. Dodis and Wichs~(STOC 2009) showed the existence of $(k, \varepsilon)$-non-malleable extractors with seed length $d = \log(n-k-1) + 2\log(1/\varepsilon) + 6$ that support sources of entropy $k > \log(d) + 2 \log(1/\varepsilon) + 8$. We show that the foregoing bound is essentially tight, by proving that any $(k,\varepsilon)$-non-malleable extractor must satisfy the entropy bound $k > \log(d) + 2 \log(1/\varepsilon) - \log\log(1/\varepsilon) - C$ for an absolute constant $C$. In particular, this implies that non-malleable extractors require min-entropy at least $\Omega(\log\log(n))$. This is in stark contrast to the existence of strong seeded extractors that support sources of entropy $k = O(\log(1/\varepsilon))$. Our techniques strongly rely on coding theory. In particular, we reveal an inherent connection between non-malleable extractors and error correcting codes, by proving a new lemma which shows that any $(k,\varepsilon)$-non-malleable extractor with seed length $d$ induces a code $C \subseteq \{0,1\}^{2^k}$ with relative distance $0.5 - 2\varepsilon$ and rate $\frac{d-1}{2^k}$.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Tom Gur, Igor Shinkar. 2018-01-10. An Entropy Lower Bound for Non-Malleable Extractors. https://arxiv.org/abs/1801.03200

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗