Symmetric-key encryption scheme with multi-ciphertext non-malleability

Abstract

A standard notion of non-malleability is that an adversary cannot forge a ciphertext c′ from a single valid ciphertext c for which a plaintext m′ of c′ is meaningfully related to a plaintext m of c. The multi-ciphertext non-malleability is a stronger notion; an adversary is allowed to obtain multiple ciphertexts c 1,c 2,. in order to forge c′. We provide an efficient symmetric-key encryption scheme with an information-theoretic version of the multi-ciphertext non-malleability in this paper by using l-wise almost independent permutations of Kaplan, Naor, and Reingold. © Springer-Verlag Berlin Heidelberg 2012.