We introduce the notion of “non-malleable codes” which relaxes the notion of error
correction and error detection. Informally, a code is non-malleable if the message contained …

Non-malleable codes provide a useful and meaningful security guarantee in situations
where traditional errorcorrection (and even error-detection) is impossible; for example, when …

We provide a formal treatment of security of digital signatures against subversion attacks
(SAs). Our model of subversion generalizes previous work in several directions, and is …

Non-malleable codes, defined by Dziembowski, Pietrzak, and Wichs (ICS'10), provide
roughly the following guarantee: if a codeword c encoding some message x is tampered to …

Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a
useful message integrity guarantee in situations where traditional error-correction (and even …

Non-malleable codes are a generalization of classical error-correcting codes where the act
of “corrupting” a codeword is replaced by a “tampering” adversary. Non-malleable codes …

We show how to construct efficient, unconditionally secure non-malleable codes for
bounded output locality. In particular, our scheme is resilient against functions such that any …

We give an explicit construction of non-malleable codes with rate 1-o (1) for the tampering
class of poly-size circuits. This rate is optimal, and improves upon the previous explicit …

We show a general framework for constructing non-malleable codes against tampering
families with average-case hardness bounds. Our framework adapts ideas from the Naor …

Abstract Non-malleable codes (NMCs), introduced by Dziembowski, Pietrzak and Wichs
(ITCS 2010), provide a powerful guarantee in scenarios where the classical notion of error …