The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Secure Ranked Keyword Search over Encrypted Cloud Data
Abstract
As Cloud Computing becomes prevalent, sensitive information are being increasingly centralized into the cloud. For the protection of data privacy, sensitive data has to be encrypted before outsourcing, which makes effective data utilization a very challenging task. Although traditional searchable encryption schemes allow users to securely search over encrypted data through keywords, these techniques support only boolean search, without capturing any relevance of data files. This approach suffers from two main drawbacks when directly applied in the context of Cloud Computing. On the one hand, users, who do not necessarily have pre-knowledge of the encrypted cloud data, have to post process every retrieved file in order to find ones most matching their interest, On the other hand, invariably retrieving all files containing the queried keyword further incurs unnecessary network traffic, which is absolutely undesirable in today's pay-as-you-use cloud paradigm. In this paper, for the first time we define and solve the problem of effective yet secure ranked keyword search over encrypted cloud data. Ranked search greatly enhances system usability by returning the matching files in a ranked order regarding to certain relevance criteria (e.g., keyword frequency), thus making one step closer towards practical deployment of privacy-preserving data hosting services in Cloud Computing. We first give a straightforward yet ideal construction of ranked keyword search under the state-of-the-art searchable symmetric encryption (SSE) security definition, and demonstrate its inefficiency. To achieve more practical performance, we then propose a definition for ranked searchable symmetric encryption, and give an efficient design by properly utilizing the existing cryptographic primitive, order-preserving symmetric encryption (OPSE). Thorough analysis shows that our proposed solution enjoys ``as-strong-as-possible" security guarantee compared to previous SSE schemes, while correctly realizing the goal of ranked keyword search. Extensive experimental results demonstrate the efficiency of the proposed solution.
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
Above the Clouds: A Berkeley View of Cloud Computing
Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R. H., Konwinski, A., Lee, G., Patterson, D. A., Rabkin, A., Stoica, I. G., et al. (2009) · Cited by 5,796
Practical 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
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Modern Information Retrieval : A Brief Overview
Singhal, A. (2001) · IEEE Data(base) Engineering Bulletin · Cited by 1,556
Kamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
Privacy Preserving Keyword Searches on Remote Encrypted Data
Chang, Y.-C., & Mitzenmacher, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_30 · Cited by 1,041
Order-Preserving Symmetric Encryption
Boldyreva, A., Chenette, N., Lee, Y., & O’Neill, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_13 · Cited by 887
Fuzzy Keyword Search over Encrypted Data in Cloud Computing
Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462196 · Cited by 861
Self-citationSecure Conjunctive Keyword Search over Encrypted Data
Golle, P., Staddon, J., & Waters, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24852-1_3 · Cited by 773
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
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Hwang, Y. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73489-5_2 · Cited by 407
Exploring the similarity space
Zobel, J., & Moffat, A. (1998) · ACM SIGIR Forum · doi:10.1145/281250.281256 · Cited by 378
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Confidentiality-preserving rank-ordered search
Swaminathan, A., Mao, Y., Su, G.-M., Gou, H., Varna, A. L., He, S., Wu, M., & Oard, D. W. (2007) · Proceedings of the 2007 ACM workshop on Storage security and survivability · doi:10.1145/1314313.1314316 · Cited by 162
Zerr, S., Olmedilla, D., Nejdl, W., et al. (2009) · doi:10.1145/1516360.1516412 · Cited by 117
Cited by
Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.45 · Cited by 1,259
Self-citationEnabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement
Fu, Z., Ren, K., Shu, J., Sun, X., & Huang, F. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2506573 · Cited by 696
Self-citationSecuring Fog Computing for Internet of Things Applications: Challenges and Solutions
Ni, J., Zhang, K., Lin, X., & Shen, X. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2762345 · Cited by 659
Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement
Fu, Z., Wu, X., Guan, C., Sun, X., & Ren, K. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2596138 · Cited by 547
Self-citationEnabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data
Wang, C., Cao, N., Ren, K., & Lou, W. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.282 · Cited by 531
Self-citation
Metadata
- Authors
- Wang, C., Cao, N., Li, J., Ren, K., & Lou, W.
- Venue
- 2010 IEEE 30th International Conference on Distributed Computing Systems
- Publisher
- IEEE
- Published
- 2010
- Pages
- 253-262
- OpenAlex
- W2108590723
- Cited by
- 732
- References
- 17
- FWCI
- 29.37
- 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.