May 1, 2015 · We construct the first explicit non-malleable two-source extractor with tampering degree t up to n^{\Omega(1)}, which works for min-entropy k \ ...

Mar 30, 2016 · \item We motivate and initiate the study of two natural generalizations of seedless non-malleable extractors and non-malleable codes, where the ...

Jun 19, 2016 · We obtain the first explicit non-malleable codes with tampering degree t, with near optimal rate and error. We call these stronger notions one-many and many- ...

We motivate and initiate the study of two natural generalizations of seedless nonmalleable extractors and nonmalleable codes, where the sources or the codeword ...

May 3, 2015 · These are seeded non-malleable extractors, introduced by Dodis and Wichs [DW09]; seedless non-malleable extractors, introduced by Cheraghchi and ...

Abstract. Randomness extractors and error correcting codes are fundamental objects in computer science. Re- cently, there have been several ...

ABSTRACT. Randomness extractors and error correcting codes are fun- damental objects in computer science. Recently, there have been several natural ...

The first explicit non-malleable two-source extractor for polylogarithmic min-entropy is constructed, which dramatically improves all previous results and ...

We construct the first explicit non-malleable two-source extractor with tampering degree $t$ up to $n^{\Omega(1)}$, which works for min-entropy $k \geq n-n^{\ ...

Non-Malleable Extractors and Codes, with their ManyTampered ExtensionsEshan Chattopadhyay∗Vipul Goyal†Xin Li‡March 21, 2016AbstractRandomness extractors ...