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 construct an efficient information-theoretically non-malleable code in the split-state
model for one-bit messages. Non-malleable codes were introduced recently by …

Physical computational devices leak side-channel information that may, and often does,
reveal secret internal states. We present a general transformation that compiles any circuit …

Non-malleable codes are a natural relaxation of error correcting/detecting codes that have
useful applications in the context of tamper resilient cryptography. Informally, a code is non …

We consider the following basic question: to what extent are standard secret sharing
schemes and protocols for secure multiparty computation that build on them resilient to …

In the past 15 years, cryptography has made considerable progress in expanding the
adversarial attack model to cover side-channel attacks and has built schemes to provably …

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 …

WeN consider a public and keyless code (Enc, Dec) which is used to encode a message m
and derive a codeword c= Enc (m). The codeword can be adversarially tampered via a …

We study the local leakage resilience of Shamir's secret sharing scheme. In Shamir's
scheme, a random polynomial f of degree t is sampled over a field of size p> n, conditioned …