A Secure Data Deduplication Scheme for Cloud Storage
The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 1×
“Also, let secret x ←R Zq and {xi} i=0 be n shares of x such that any set of t shares can be used to reconstruct x through polynomial interpolation (see [20] for more details).”
BackgroundAttribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009 · cited 1×
“Hence, our security notion is not the strongest possible, similarly to “selective security” for attribute-based encryption [26, 18].”
BackgroundFuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440 · cited 1×
“Hence, our security notion is not the strongest possible, similarly to “selective security” for attribute-based encryption [26, 18].”
BackgroundDouceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 2×
“agement, sybil attacks [15] could be mounted by spawning sufficient sybil accounts to force a file to become popular: in this way, the semantically secure encryption layer could be forced off and information could be inferred”
BackgroundGoldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603 · cited 1×
“Specifically, we achieve two different security notions, depending on the nature of each datum, as follows: i)Semantic security [16] for unpopular data; ii) Con-”
MethodPolynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,361
Universally composable two-party and multi-party secure computation
Canetti, R., Lindell, Y., Ostrovsky, R., & Sahai, A. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509980 · Cited by 717
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 · cited 1×
“For these reasons, deduplication is a critical enabler for a number of popular and successful storage services (e.g. Dropbox, Memopal) that offer cheap, remote storage to the broad public by performing client-side deduplication, thus saving both the network bandwidth and storage costs.”
BackgroundMessage-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 · cited 2×
“While DupLESS offers the possibility to securely use server-side deduplication, our scheme targets secure client-side deduplication.”
BackgroundRodrigues, R., & Druschel, P. (2010) · Communications of the ACM · doi:10.1145/1831407.1831427 · Cited by 562
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 · cited 3×
“(such as Proof of Ownership [8, 9]) can be applied to secure this step.”
BackgroundInfluentialSide 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 · cited 1×
“[7] have presented a number of attacks that can lead to data leakage in storage systems in which client-side deduplication is in place.”
BackgroundLysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46513-8_14 · Cited by 521 · cited 1×
“One solution for the latter case would be to incorporate anonymous and unlinkable credentials [23, 24] every time user”
BackgroundDupLESS: Server-Aided Encryption for Deduplicated Storage.
Bellare, M., Keelveedhi, S., & Ristenpart, T. (2013) · Cited by 456
Storer, M. W., Greenan, K., Long, D. D. E., & Miller, E. L. (2008) · Proceedings of the 4th ACM international workshop on Storage security and survivability · doi:10.1145/1456469.1456471 · Cited by 288 · cited 1×
“[10, 11], attempting to combine data confidentiality with the possibility of”
BackgroundUniversally Composable Security: A New Paradigm for Cryptographic Protocols.Preprint
Canetti, R. (2000) · IACR Cryptology ePrint Archive · Cited by 255
Weak leakage-resilient client-side deduplication of encrypted data in cloud storage
Xu, J., Chang, E., & Zhou, J. (2013) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2484313.2484340 · Cited by 220
Johansson, T., & Nguyễn, P. Q. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9 · Cited by 215
Boosting efficiency and security in proof of ownership for deduplication
Di Pietro, R., & Sorniotti, A. (2012) · Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security · doi:10.1145/2414456.2414504 · Cited by 175 · cited 1×
“Deduplication is most rewarding when it is triggered at the client side, as it also saves upload bandwidth.”
BackgroundSelf-citationDemystifying data deduplication
Mandagere, N., Zhou, P., Smith, M. A., & Uttamchandani, S. (2008) · ACM/IFIP/USENIX international conference on Middleware · doi:10.1145/1462735.1462739 · Cited by 138 · cited 1×
“Storage efficiency functions such as compression and deduplication afford storage providers better utilization of their storage backends and the ability to serve more customers with the same infrastructure.”
BackgroundThe design of a similarity based deduplication system
Aronovich, L., Asher, R., Bachmat, E., Bitner, H., Hirsch, M., & Klein, S. T. (2009) · doi:10.1145/1534530.1534539 · Cited by 119 · cited 1×
“Storage efficiency functions such as compression and deduplication afford storage providers better utilization of their storage backends and the ability to serve more customers with the same infrastructure.”
BackgroundSecret Handshakes with Dynamic and Fuzzy Matching.
Ateniese, G., Kirsch, J., & Blanton, M. (2007) · IRIS Research product catalog (Sapienza University of Rome) · Cited by 101
Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
Camenisch, J. L., Hohenberger, S., & Lysyanskaya, A. (2006) · Lecture notes in computer science · doi:10.1007/11832072_10 · Cited by 96
Helping Johnny 2.0 to encrypt his Facebook conversations
Fahl, S., Harbach, M., Muders, T., Smith, M., & Sander, U. (2012) · Symposium On Usable Privacy and Security · doi:10.1145/2335356.2335371 · Cited by 77 · cited 1×
“achieving security objectives all the while preserving usability [17, 18].”
BackgroundEstimation of deduplication ratios in large data sets
Harnik, D., Margalit, O., Naor, D., Sotnikov, D., & Vernik, G. (2012) · Digest of papers - IEEE Symposium on Mass Storage Systems · doi:10.1109/msst.2012.6232381 · Cited by 43 · cited 1×
“Several deduplication schemes have been proposed by the research community [2–4] showing how deduplication allows very appealing reductions in the usage of storage resources [5, 6].”
BackgroundConfidentiality as a Service -- Usable Security for the Cloud
Fahl, S., Harbach, M., Muders, T., et al. (2012) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2012.112 · Cited by 41 · cited 1×
“achieving security objectives all the while preserving usability [17, 18].”
BackgroundPseudonym Systems (Extended Abstract)
Lysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Cited by 30
Cited by
A Hybrid Cloud Approach for Secure Authorized Deduplication
Li, J., Li, Y. K., Chen, X., Lee, P. P. C., & Lou, W. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2318320 · Cited by 412
Yang, Y., Zheng, X., Guo, W., Liu, X., & Chang, V. (2019) · Information Sciences · doi:10.1016/j.ins.2018.02.005 · Cited by 364
Secure Distributed Deduplication Systems with Improved Reliability
Li, J., Chen, X., Huang, X., Tang, S., Xiang, Y., Hassan, M. M., & Alelaiwi, A. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2401017 · Cited by 160
“[21] presented a novel encryption scheme that provided differential security for popular and unpopular data.”
Background
Metadata
- Authors
- Stanek, J., Sorniotti, A., Androulaki, E., & Kencl, L.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2014
- Pages
- 99-118
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W48174705
- Cited by
- 189
- References
- 27
- FWCI
- 17.59
- Type
- conference paper
- 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
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.