Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits

• Published in: IEEE transactions on information theory Vol. 62; no. 12; pp. 7179 - 7194
• Main Authors: Faust, Sebastian, Mukherjee, Pratyay, Venturi, Daniele, Wichs, Daniel
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.12.2016; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Codes; Cryptography; Decoding; Efficiency; Electronic mail; Encoding; key derivation; Non-malleable codes; Probabilistic logic; Probability; Resilience; tamper-resilient cryptography

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 c'= f (c) such that c' ≠ c, then the tampered message x' contained in c' reveals no information about x...