A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Non-malleable Reductions and Applications
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15
Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a useful message integrity guarantee in situations where traditional error-correction (and even error-detection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely "unrelated value". Although such codes do not exist if the family of
doi:10.1145/2746539.2746544
dblp:conf/stoc/AggarwalDKO15
fatcat:bubvujeuz5endhk6ykhwqurdaq