Non-malleable codes from additive combinatorics
Non-malleable codes provide a useful and meaningful security guarantee in situations
where traditional errorcorrection (and even error-detection) is impossible; for example, when …
where traditional errorcorrection (and even error-detection) is impossible; for example, when …
Tamper and leakage resilience in the split-state model
It is notoriously difficult to create hardware that is immune from side channel and tampering
attacks. A lot of recent literature, therefore, has instead considered algorithmic defenses from …
attacks. A lot of recent literature, therefore, has instead considered algorithmic defenses from …
Non-malleable codes from two-source extractors
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 …
model for one-bit messages. Non-malleable codes were introduced recently by …
Non-malleable extractors and codes, with their many tampered extensions
Randomness extractors and error correcting codes are fundamental objects in computer
science. Recently, there have been several natural generalizations of these objects, in the …
science. Recently, there have been several natural generalizations of these objects, in the …
Continuous non-malleable codes
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 …
useful applications in the context of tamper resilient cryptography. Informally, a code is non …
Non-malleable reductions and applications
Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a
useful message integrity guarantee in situations where traditional error-correction (and even …
useful message integrity guarantee in situations where traditional error-correction (and even …
Efficient non-malleable codes and key derivation for poly-size tampering circuits
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 …
roughly the following guarantee: if a codeword c encoding some message x is tampered to …
Tamper detection and continuous non-malleable codes
Z Jafargholi, D Wichs - Theory of Cryptography Conference, 2015 - Springer
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 …
and derive a codeword c= Enc (m). The codeword can be adversarially tampered via a …
FlexIO: I/O middleware for location-flexible scientific data analytics
Increasingly severe I/O bottlenecks on High-End Computing machines are prompting
scientists to process simulation output data online while simulations are running and before …
scientists to process simulation output data online while simulations are running and before …
Optimal computational split-state non-malleable codes
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 …
of “corrupting” a codeword is replaced by a “tampering” adversary. Non-malleable codes …