Non-Malleable Codes
@article{Dziembowski2009NonMalleableC, title={Non-Malleable Codes}, author={Stefan Dziembowski and K. Pietrzak and Daniel Wichs}, journal={Journal of the ACM (JACM)}, year={2009}, volume={65}, pages={1 - 32} }
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 in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of… CONTINUE READING
Supplemental Presentations
Topics from this paper
94 Citations
Non-malleable Reductions and Applications
- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2014
- 87
- PDF
Continuously Non-malleable Codes in the Split-State Model
- Computer Science
- Journal of Cryptology
- 2020
- PDF
Constant-rate Non-malleable Codes in the Split-state Model
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2017
- 12
- PDF
Locally Decodable and Updatable Non-malleable Codes and Their Applications
- Computer Science
- Journal of Cryptology
- 2018
- 19
- Highly Influenced
- PDF
Capacity of Non-Malleable Codes
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2016
- 44
- Highly Influenced
References
SHOWING 1-2 OF 2 REFERENCES
Private Circuits II: Keeping Secrets in Tamperable Circuits
- Mathematics, Computer Science
- EUROCRYPT
- 2006
- 162
- Highly Influential
- PDF
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
- Computer Science
- TCC
- 2004
- 211
- Highly Influential
- PDF