Non-malleable Codes for Bounded Parallel-Time Tampering

Download PDF
Open Webpage

Dana Dachman-Soled, Ilan Komargodski, Rafael Pass

Published: 2021, Last Modified: 26 Jan 2026CRYPTO (3) 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Non-malleable codes allow one to encode data in such a way that once a codeword is being tampered with, the modified codeword is either an encoding of the original message, or a completely unrelated one. Since the introduction of this notion by Dziembowski, Pietrzak, and Wichs (ICS ’10 and J. ACM ’18), there has been a large body of works realizing such coding schemes secure against various classes of tampering functions. It is well known that there is no efficient non-malleable code secure against all polynomial size tampering functions. Nevertheless, no code which is non-malleable for bounded polynomial size attackers is known and obtaining such a code has been a major open problem.