publication . Conference object . Other literature type . Part of book or chapter of book . 2016

Verifiable Message-Locked Encryption

Sébastien Canard; Fabien Laguillaumie; Marie Paindavoine;
Open Access English
  • Published: 14 Nov 2016
  • Publisher: HAL CCSD
  • Country: France
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 existi...
ACM Computing Classification System: Data_FILES
free text keywords: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Computer science, Homomorphic encryption, Cloud storage, Encryption, business.industry, business, Data deduplication, Commitment scheme, Server, Computer security, computer.software_genre, computer, Random oracle, ElGamal encryption
Funded by
  • Funder: European Commission (EC)
  • Project Code: 643964
  • Funding stream: H2020 | RIA
Lattices: algorithms and cryptography
  • Funder: European Commission (EC)
  • Project Code: 335086
  • Funding stream: FP7 | SP2 | ERC
Download fromView all 6 versions
Hyper Article en Ligne
Conference object . 2016
Other literature type . 2016
Provider: Datacite
Conference object . 2016
Provider: ZENODO
19 references, page 1 of 2

1. M. Abadi, D. Boneh, I. Mironov, A. Raghunathan, and G. Segev. Message-locked encryption for lock-dependent messages. In Advances in Cryptology - CRYPTO 2013. LNCS, vol. 8042 pp. 374{391, 2013. [OpenAIRE]

2. M. Bellare, A. Boldyreva, and A. O'Neill. Deterministic and e ciently searchable encryption. In Advances in Cryptology - CRYPTO 2007. LNCS, vol.4622, pp. 535{552, 2007. [OpenAIRE]

3. M. Bellare and S. Keelveedhi. Interactive message-locked encryption and secure deduplication. In Public-Key Cryptography - PKC 2015. LNCS, vol.9020, pp. 516{ 538, 2015. [OpenAIRE]

4. M. Bellare, S. Keelveedhi, and T. Ristenpart. Message-locked encryption and secure deduplication. In Advances in Cryptology - EUROCRYPT 2013. LNCS, vol.7881, pp. 296{312, 2013. [OpenAIRE]

5. D. Boneh, A. Sahai, and B. Waters. Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys. In Advances in Cryptology - EUROCRYPT 2006. LNCS vol. 4004, pp. 573{592, 2006. [OpenAIRE]

6. K. Chung and S. P. Vadhan. Tight bounds for hashing block sources. In APPROX 2008 RANDOM 2008. LNCS, vol.5171, pp. 357{370, 2008.

7. L. P. Cox, C. D. Murray, and B. D. Noble. Pastiche: Making backup cheap and easy. In Proceedings of the 5th Symposium on Operating Systems Design and implementation, OSDI '02. ACM, pp. 285{298, 2002

8. J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer. Reclaiming space from duplicate les in a serverless distributed le system. In ICDCS, pp. 617{624, 2002.

9. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identi cation and signature problems. In Advances in Cryptology { CRYPTO'86. LNCS, vol.263, pp. 186{194, 1986.

10. The Flud backup system. http://

11. J. Groth. Short non-interactive zero-knowledge proofs. In Advances in Cryptology { ASIACRYPT 2010. LNCS, vol.6477, pp. 341{358, 2010.

12. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from oneway functions. In Proceedings of the Twenty- rst Annual ACM Symposium on Theory of Computing, STOC '89. ACM, pp. 12{24, 1989.

13. T. P. Pedersen. Non-interactive and information-theoretic secure veri able secret sharing. In Advances in Cryptology - CRYPTO '91. LNCS, vol.576, pp. 129{140, 1991.

14. David Pointcheval, Jacques Stern. Security Arguments for Digital Signatures and Blind Signatures. In J. Cryptology 13(3), pages 361-396, 2000.

15. A. Raghunathan, G. Segev, and S. P. Vadhan. Deterministic public-key encryption for adaptively chosen plaintext distributions. In Advances in Cryptology - EUROCRYPT 2013. LNCS, vol.7881, pp. 93{110, 2013.

19 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue