Conference paper Open Access

# Verifiable Message-Locked Encryption

Canard, Sébastien; Laguillaumie, Fabien; Paindavoine

### Citation Style Language JSON Export

{
"publisher": "Zenodo",
"DOI": "10.5281/zenodo.58898",
"title": "Verifiable Message-Locked Encryption",
"issued": {
"date-parts": [
[
2016,
7,
6
]
]
},
"abstract": "<p>One of today\u2019s main challenge related to cloud storage is to maintain the\u00a0 functionalities and the efficiency of customers\u2019 and service providers\u2019 usual\u00a0 environments while protecting the confidentiality of sensitive data. Deduplication is one of those functionalities: it enables cloud storage providers to save a lot of\u00a0 memory by storing only once a file uploaded several times. However, classical\u00a0 encryption schemes block deduplication. One needs to use a \u201cmessage-locked\u00a0 encryption\u201d scheme (MLE), which allows the detection of duplicates and the\u00a0 storage of only one encrypted file on the server, which can be decrypted by any\u00a0 owner of the file. However, in most existing scheme, a user can bypass this\u00a0 deduplication protocol. In this article, we provide servers verifiability for MLE schemes: the servers can verify that the ciphertexts are well-formed. This property\u00a0 forces a customer to prove that she complied to the deduplication\u00a0 protocol, thus preventing her to deviate from the prescribed functionality of MLE. Then, we provide an MLE scheme satisfying this new security property. To\u00a0 achieve the deduplication consistency, our construction primarily relies on\u00a0 zero-knowledge proofs. Unlike Abadi et al.\u2019s MLE, we instantiate those proofs, so<br>\nthat we obtain a more efficient scheme, secure in the random oracle model.</p>",
"author": [
{
"family": "Canard, S\u00e9bastien"
},
{
"family": "Laguillaumie, Fabien"
},
{
"family": "Paindavoine"
}
],
"type": "paper-conference",
"id": "58898"
}
54
32
views