An Entropy Lower Bound for Non-Malleable Extractors

Electronic Colloquium on Computational Complexity (ECCC), Volume 25, 2018, Pages 8

Cited by: 2|Bibtex|Views17|Links
EI

Abstract:

A $(k,varepsilon)$-non-malleable extractor is a function ${sf nmExt} : {0,1}^n times {0,1}^d {0,1}$ that takes two inputs, a weak source $X sim {0,1}^n$ of min-entropy $k$ and an independent uniform seed $s {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 nm...More

Code:

Data:

Your rating :
0

 

Tags
Comments