Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs \cite{DPW10} as an elegant generalization of the classical notions of error detection, where the corruption of a codeword is viewed as a tampering function acting on it. Informally, a non-malleable code with respect to a family of tampering functions \mathcal{F} consists ... more >>>

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 C, mappings seeds to seeds, if the seed Y remains close to uniform even after observing the output \mathrm{Ext}(X,A(Y)) for every choice of $A \in ... more >>>