The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Secure Deduplication with Efficient and Reliable Convergent Key Management
Abstract
Data deduplication is a technique for eliminating duplicate copies of data, and has been widely used in cloud storage to reduce storage space and upload bandwidth. Promising as it is, an arising challenge is to perform secure deduplication in cloud storage. Although convergent encryption has been extensively adopted for secure deduplication, a critical issue of making convergent encryption practical is to efficiently and reliably manage a huge number of convergent keys. This paper makes the first attempt to formally address the problem of achieving efficient and reliable key management in secure deduplication. We first introduce a baseline approach in which each user holds an independent master key for encrypting the convergent keys and outsourcing them to the cloud. However, such a baseline key management scheme generates an enormous number of keys with the increasing number of users and requires users to dedicatedly protect the master keys. To this end, we propose Dekey , a new construction in which users do not need to manage any keys on their own but instead securely distribute the convergent key shares across multiple servers. Security analysis demonstrates that Dekey is secure in terms of the definitions specified in the proposed security model. As a proof of concept, we implement Dekey using the Ramp secret sharing scheme and demonstrate that Dekey incurs limited overhead in realistic environments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
Wang, Q., Wang, C., Ren, K., Lou, W., & Li, J. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.183 · Cited by 1,511
Self-citationEfficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
The Digital Universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East
Gantz, J., & Reinsel, D. (2012) · Cited by 1,138
Kamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
Reclaiming space from duplicate files in a serverless distributed file system
Douceur, J. R., Adya, A., Bolosky, W. J., Simon, P., & Theimer, M. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022312 · Cited by 645
Message-Locked Encryption and Secure Deduplication
Bellare, M., Keelveedhi, S., & Ristenpart, T. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_18 · Cited by 632
Proofs of ownership in remote storage systems
Halevi, S., Harnik, D., Pinkas, B., & Shulman-Peleg, A. (2011) · Proceedings of the 18th ACM conference on Computer and communications security · doi:10.1145/2046707.2046765 · Cited by 562
Side Channels in Cloud Services: Deduplication in Cloud Storage
Harnik, D., Pinkas, B., & Shulman-Peleg, A. (2010) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2010.187 · Cited by 522
A study of practical deduplication
Meyer, D. T., & Bolosky, W. J. (2012) · ACM Transactions on Storage · doi:10.1145/2078861.2078864 · Cited by 476
Cited by
Multi-key privacy-preserving deep learning in cloud computing
Li, P., Li, J., Huang, Z., Li, T., Gao, C.-Z., Yiu, S.-M., & Chen, K. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.02.006 · Cited by 462
Self-citationA lightweight multi-layer authentication protocol for wireless body area networks
Shen, J., Chang, S., Shen, J., Liu, Q., & Sun, X. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2016.11.033 · Cited by 258
Cloud-assisted secure ehealth systems for tamper-proofing EHR via blockchain
Cao, S., Zhang, G., Liu, P., Zhang, X., & Neri, F. (2019) · Information Sciences · doi:10.1016/j.ins.2019.02.038 · Cited by 245
An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain
Lin, Q., Yan, H., Huang, Z., Chen, W., Shen, J., & Tang, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2809426 · Cited by 202
Pundir, S., Wazid, M., Singh, D. P., Das, A. K., Rodrigues, J. J. P. C., & Park, Y. (2020) · IEEE Access · doi:10.1109/access.2019.2962829 · Cited by 202
Metadata
- Authors
- Li, J., Chen, X., Li, M., Li, J., Lee, P. P. C., & Lou, W.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2014-06
- Volume
- 25
- Issue
- 6
- Pages
- 1615-1625
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2129167380
- Cited by
- 549
- References
- 21
- FWCI
- 131.59
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Secure Deduplication with Efficient and Reliable Convergent Key Management. https://app.cochat.ai/papers/10.1109/tpds.2013.284
- The paper
- Li, J., Chen, X., Li, M., Li, J., Lee, P. P. C., & Lou, W. (2014). Secure Deduplication with Efficient and Reliable Convergent Key Management. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2013.284
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
