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}
}
  • Stefan Dziembowski, K. Pietrzak, Daniel Wichs
  • Published 2009
  • Computer Science, Mathematics
  • Journal of the ACM (JACM)
  • 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
    94 Citations

    Topics from this paper

    Non-Malleable Codes Against Affine Errors
    • Highly Influenced
    • PDF
    Non-malleable Reductions and Applications
    • 87
    • PDF
    Continuously Non-malleable Codes in the Split-State Model
    • PDF
    Constant-rate Non-malleable Codes in the Split-state Model
    • 12
    • PDF
    Locally Decodable and Updatable Non-malleable Codes and Their Applications
    • 19
    • Highly Influenced
    • PDF
    Capacity of Non-Malleable Codes
    • 44
    • Highly Influenced
    Non-Malleable Codes
    • 66
    • PDF

    References

    SHOWING 1-2 OF 2 REFERENCES
    Private Circuits II: Keeping Secrets in Tamperable Circuits
    • 162
    • Highly Influential
    • PDF
    Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
    • 211
    • Highly Influential
    • PDF