Message-Locked Encryption and Secure Deduplication
By Mihir Bellare, Sriram Keelveedhi, Thomas Ristenpart. 2013
847 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Kui Ren
- Wenjing Lou
- Ú. Erlingsson
- Ananth Raghunathan
- Qian Wang
- Sriram Keelveedhi
- Thomas Ristenpart
- Ilya Mironov
In Information Systems
Citations in the corpus
- Prochlo: Strong Privacy for Analytics in the Crowd (2017, background): “Ciphertext c is a deterministic encryption of the message under a message-derived key [3,9] km = H(m) and aux is a (randomized) t-secret share of km.”
- A Comprehensive Study of the Past, Present, and Future of Data Deduplication (2016, methodology): “Messagelocked encryption (MLE) [155] studies and Table 8 State-of-the-Art Schemes to Secure Data Deduplication Vol. 104, No. 9, September 2016 | Proceedings of the IEEE 1697 compares CE and its variants, hash-based CE [151], randomized CE in practice and theory.”
- Blockchain Meets Cloud Computing: A Survey (2020, background): “Message-lock encryption (MLP) [121] later suggested that convergent encryption was a kind of form of it.”
- Dynamic Data Operations with Deduplication in Privacy-Preserving Public Auditing for Secure Cloud Storage (2017, positive): “Convergent encryption provides data confidentiality in deduplication, as it is mentioned in [21], [22].”
- DupLESS: Server-Aided Encryption for Deduplicated Storage (2013, background): “One approach aimed at resolving this tension is message-locked encryption (MLE) [18].”
- PROCHLO: Strong Privacy for Analytics in the Crowd (2017, background): “Ciphertext c is a deterministic encryption of the message under a message-derived key [3,9] km = H(m) and aux is a (randomized) t-secret share of km.”