2015
DOI: 10.1007/978-3-662-46447-2_23
|View full text |Cite
|
Sign up to set email alerts
|

Interactive Message-Locked Encryption and Secure Deduplication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
34
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 89 publications
(37 citation statements)
references
References 38 publications
0
34
0
Order By: Relevance
“…Namely, it ensures more optimal usage of the resources at the cloud side (e.g., Bitcasa, Dropbox). Unfortunately, encryption of data with classical cryptosystems cannot be deduplicated (Abadi et al 2013;Bellare and Keelveedhi 2015;Liu et al 2015b;Zheng et al 2015;Rabotka and Mannan 2016). Hence, current existing applications have either security or storage efficiency issues.…”
Section: Secure Deduplicationmentioning
confidence: 95%
“…Namely, it ensures more optimal usage of the resources at the cloud side (e.g., Bitcasa, Dropbox). Unfortunately, encryption of data with classical cryptosystems cannot be deduplicated (Abadi et al 2013;Bellare and Keelveedhi 2015;Liu et al 2015b;Zheng et al 2015;Rabotka and Mannan 2016). Hence, current existing applications have either security or storage efficiency issues.…”
Section: Secure Deduplicationmentioning
confidence: 95%
“…Jin et al [31] proposed an anonymous deduplication scheme over encrypted data that exploits a proxy reencryption algorithm. Bellare et al [28] proposed a server-aided MLE which is secure against brute-force attack, which was recently extended to interactive MLE [29] to provide privacy for messages that are both correlated and dependent on the public system parameters. However, these schemes do not handle the dynamic ownership management issues involved in secure deduplication for shared outsourced data.…”
Section: Deduplication Over Encrypted Datamentioning
confidence: 99%
“…Abadi et al [3] propose two encrypted deduplication schemes for the chunks that depend on public parameters, yet either of them builds on computationally expensive non-interactive zero knowledge (NIZK) proofs or produces deterministic ciphertext components. Interactive MLE [11] addresses chunk correlation and parameter dependence, yet it is impractical for the use of fully homomorphic encryption (FHE). This paper differs from the above works by using lightweight primitives for practical encrypted deduplication.…”
Section: Related Workmentioning
confidence: 99%