Message-Locked Encryption and Secure Deduplication
The DOI matches its Crossref record; 28 of the 28 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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Self-citationPractical techniques for searches on encrypted data
Song, D. X., Wagner, D., & Perrig, A. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848445 · Cited by 3,350
Public Key Encryption with Keyword Search
Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_30 · Cited by 3,134
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
A concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Self-citationNon-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Self-citationThe Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Bellare, M., & Rogaway, P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_25 · Cited by 672
Self-citationReclaiming 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
Nisan, N., & Zuckerman, D. (1996) · Journal of Computer and System Sciences · doi:10.1006/jcss.1996.0004 · Cited by 634
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
OCB: a block-cipher mode of operation for efficient authenticated encryption
Rogaway, P., Bellare, M., Black, J., & Krovetz, T. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502011 · Cited by 368
Self-citationCox, L. P., Murray, C. D., & Noble, B. D. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844155 · Cited by 334
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
Boldyreva, A., Fehr, S., & O’Neill, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_19 · Cited by 232
Tahoe: the least-authority filesystem
Wilcox-O'Hearn, Z., & Warner, B. (2008) · Proceedings of the 4th ACM international workshop on Storage security and survivability · doi:10.1145/1456469.1456474 · Cited by 171
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Bellare, M., Fischlin, M., O’Neill, A., & Ristenpart, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_20 · Cited by 166
Self-citationA Secure Cloud Backup System with Assured Deletion and Version Control
Rahumed, A., Chen, H. C. H., Tang, Y. S., Lee, P. P. C., & Lui, J. C. S. (2011) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1109/icppw.2011.17 · Cited by 134
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Bellare, M., Brakerski, Z., Naor, M., Ristenpart, T., Segev, G., Shacham, H., & Yilek, S. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_14 · Cited by 129
Self-citationCorrelated-Input Secure Hash Functions
Goyal, V., O’Neill, A., & Rao, V. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_12 · Cited by 111
Fuller, B. W., O’Neill, A., & Reyzin, L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_33 · Cited by 80
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Brakerski, Z., & Segev, G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_31 · Cited by 79
Barriers in cryptography with weak, correlated and leaky sources
Wichs, D. (2013) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2422436.2422451 · Cited by 54
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
Vadhan, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_4 · Cited by 48
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
Lu, C.-J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_17 · Cited by 36
Rogaway, P., Mihir Bellare, Y., Black, J. H., et al. (2001) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/502010.502011 · Cited by 29
Cited by
Secure Deduplication with Efficient and Reliable Convergent Key Management
Li, J., Chen, X., Li, M., Li, J., Lee, P. P. C., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.284 · Cited by 549
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
Blockchain Meets Cloud Computing: A Survey
Gai, K., Guo, J., Zhu, L., & Yu, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2989392 · Cited by 381
Yang, Y., Zheng, X., Guo, W., Liu, X., & Chang, V. (2019) · Information Sciences · doi:10.1016/j.ins.2018.02.005 · Cited by 364
A Comprehensive Study of the Past, Present, and Future of Data Deduplication
Xia, W., Jiang, H., Feng, D., Douglis, F., Shilane, P., Hua, Y., Fu, M., Zhang, Y., & Zhou, Y. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2571298 · Cited by 318
Metadata
- Authors
- Bellare, M., Keelveedhi, S., & Ristenpart, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 296-312
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2165257856
- Cited by
- 632
- References
- 28
- FWCI
- 34.91
- 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.