Motivated by the problem of avoiding duplication in storage systems, Bellare, Keelveedhi, and Ristenpart have recently put forward the notion of Message-Locked Encryption (MLE) schemes which subsumes convergent encryption and its variants. Such schemes do not rely on permanent secret keys, but rather encrypt messages using keys derived from the messages themselves.

We strengthen the notions of security proposed by Bellare et al. by considering plaintext distributions that may depend on the public parameters of the schemes. We refer to such inputs as lock-dependent messages. We construct two schemes that satisfy our new notions of security for message-locked encryption with lock-dependent messages.

Our main construction deviates from the approach of Bellare et al. by avoiding the use of ciphertext components derived deterministically from the messages. We design a fully randomized scheme that supports an equality-testing algorithm defined on the ciphertexts.

Our second construction has a deterministic ciphertext component that enables more efficient equality testing. Security for lock-dependent messages still holds under computational assumptions on the message distributions produced by the attacker.

In both of our schemes the overhead in the length of the ciphertext is only additive and independent of the message length.

}, author = {Mart{\'i}n Abadi and Dan Boneh and Ilya Mironov and Ananth Raghunathan and Gil Segev}, booktitle = {Advances in Cryptology---CRYPTO 2013}, month = {August}, pages = {374-391}, publisher = {Springer Verlag}, series = {Lecture Notes in Computer Science}, title = {Message-Locked Encryption for Lock-Dependent Messages}, url = {http://research.microsoft.com/apps/pubs/default.aspx?id=192518}, volume = {8042}, year = {2013}, }