Conference paper Open Access

Verifiable Message-Locked Encryption

Canard, Sébastien; Laguillaumie, Fabien; Paindavoine


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <controlfield tag="005">20200120171344.0</controlfield>
  <controlfield tag="001">58898</controlfield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="d">6th July 2016</subfield>
    <subfield code="g">SEC2 2016</subfield>
    <subfield code="a">Second Workshop on Security in Clouds</subfield>
    <subfield code="c">Lorient, France</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Orange Labs</subfield>
    <subfield code="a">Laguillaumie, Fabien</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Marie</subfield>
    <subfield code="a">Paindavoine</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">615496</subfield>
    <subfield code="z">md5:47445e300a23056c9c634aac786f70ba</subfield>
    <subfield code="u">https://zenodo.org/record/58898/files/Verifiable-Message-Locked-Encryption-2016.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="y">Conference website</subfield>
    <subfield code="u">https://sec2-2016.inria.fr/en/english-program/</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2016-07-06</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="p">user-ecfunded</subfield>
    <subfield code="p">user-supercloud</subfield>
    <subfield code="o">oai:zenodo.org:58898</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Orange Labs</subfield>
    <subfield code="a">Canard, Sébastien</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Verifiable Message-Locked Encryption</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-ecfunded</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-supercloud</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">643964</subfield>
    <subfield code="a">USER-CENTRIC MANAGEMENT OF SECURITY AND DEPENDABILITY IN CLOUDS OF CLOUDS</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution Non Commercial Share Alike 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;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 uploaded several times. However, classical  encryption schemes block deduplication. One needs to use a “message-locked  encryption” scheme (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  forces a customer to prove that she complied to the deduplication  protocol, thus preventing her to deviate from the prescribed functionality of MLE. Then, we provide an MLE scheme satisfying this new security property. To  achieve the deduplication consistency, our construction primarily relies on  zero-knowledge proofs. Unlike Abadi et al.’s MLE, we instantiate those proofs, so&lt;br&gt;
that we obtain a more efficient scheme, secure in the random oracle model.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.58898</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
84
48
views
downloads
All versions This version
Views 8484
Downloads 4848
Data volume 29.5 MB29.5 MB
Unique views 8484
Unique downloads 4848

Share

Cite as