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 …

Randomness extractors and error correcting codes are fundamental objects in computer
science. Recently, there have been several natural generalizations of these objects, in the …

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 …

A threshold secret sharing scheme (with threshold t) allows a dealer to share a secret
among a set of parties such that any group of t or more parties can recover the secret and no …

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 construct efficient, unconditional non-malleable codes that are secure against tampering
functions computed by small-depth circuits. For constant-depth circuits of polynomial size (ie …

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 …

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 …

Non-malleable codes allow one to encode data in such a way that once a codeword is being
tampered with, the modified codeword is either an encoding of the original message, or a …