Verifiable Message-Locked Encryption

Sébastien Canard (1) , Fabien Laguillaumie (2, 3, 4) , Marie Paindavoine (1, 4)

1 Orange Labs [Caen]
2 ARIC - Arithmetic and Computing
3 LIP - Laboratoire de l'Informatique du Parallélisme
4 UCBL - Université Claude Bernard Lyon 1

One of today's main challenge related to cloud storage is to maintain the functionalities and the efficiency of customers' and service providers' usual environments, while protecting the confidentiality of sensitive data. Deduplication is one of those functionalities: it enables cloud storage providers to save a lot of memory by storing only once a file up-loaded several times. But classical encryption blocks deduplication. One needs to use a " message-locked encryption " (MLE), which allows the detection of duplicates and the storage of only one encrypted file on the server, which can be decrypted by any owner of the file. However, in most existing scheme, a user can bypass this deduplication protocol. In this article, we provide servers verifiability for MLE schemes: the servers can verify that the ciphertexts are well-formed. This property that we formally define forces a customer to prove that she complied to the dedupli-cation protocol, thus preventing her to deviate from the prescribed func-tionality of MLE. We call it deduplication consistency. To achieve this deduplication consistency, we provide (i) a generic transformation that applies to any MLE scheme and (ii) an ElGamal-based deduplication-consistent MLE, which is secure in the random oracle model.

Domaines: Cryptographie et sécurité [cs.CR]

Sébastien Canard, Fabien Laguillaumie, Marie Paindavoine. Verifiable Message-Locked Encryption. CANS 2016 - 15th International Conference Cryptology and Network Security, Nov 2016, Milano, Italy. pp.299 - 315, ⟨10.1007/978-3-319-48965-0_18⟩. ⟨hal-01404486⟩