Short non-malleable codes from related-key secure block ciphers
Presented at the IACR Fast Software Encryption (March 2018), Bruges, Belgium
A non-malleable code is an unkeyed randomized encoding scheme that offers the strong guarantee that decoding a tampered codeword either results in the original message, or in an unrelated message. We consider the simplest possible construction in the computational split-state model, which simply encodes a message m as k||Ek(m) for a uniformly random key k, where E is a block cipher. This construction is comparable to, but greatly simplifies over, the one of Kiayias et al. (ACM CCS 2016), who eschewed this simple scheme in fear of related-key attacks on E. In this work, we prove this construction to be a strong non-malleable code as long as E is (i) a pseudorandom permutation under leakage and (ii) related-key secure with respect to an arbitrary but fixed key relation. Both properties are believed to hold for “good” block ciphers, such as AES-128, making this non-malleable code very efficient with short codewords of length |m| + 2τ (where τ is the security parameter, e.g., 128 bits), without significant security penalty.
|Block cipher, Non-malleable code, Related-key security, Split-state tampering model|
|IACR Fast Software Encryption|
Fehr, S, Karpman, P, & Mennink, B.J.M. (2018). Short non-malleable codes from related-key secure block ciphers. In IACR Transactions on Symmetric Cryptology (pp. 336–352). doi:10.13154/tosc.v2018.i1.336-352