The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Fuzzy Keyword Search over Encrypted Data in Cloud Computing
Abstract
As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a very challenging task. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. That is, there is no tolerance of minor typos and format inconsistencies which, on the other hand, are typical user searching behavior and happen very frequently. This significant drawback makes existing techniques unsuitable in Cloud Computing as it greatly affects system usability, rendering user searching experiences very frustrating and system efficacy very low. In this paper, for the first time we formalize and solve the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Fuzzy keyword search greatly enhances system usability by returning the matching files when users' searching inputs exactly match the predefined keywords or the closest possible matching files based on keyword similarity semantics, when exact match fails. In our solution, we exploit edit distance to quantify keywords similarity and develop an advanced technique on constructing fuzzy keyword sets, which greatly reduces the storage and representation overheads. Through rigorous security analysis, we show that our proposed solution is secure and privacy-preserving, while correctly realizing the goal of fuzzy keyword search.
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
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
Conjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
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
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
Building an Encrypted and Searchable Audit Log.
Waters, B. R., Balfanz, D., Durfee, G., & Smetters, D. K. (2004) · Cited by 372
Efficient interactive fuzzy keyword search
Ji, S., Li, G., Li, C., & Feng, J. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526760 · Cited by 176
Secure Multiparty Computation of Approximations
Feigenbaum, J., Ishai, Y., Malkin, T., Kobbi Nissim, B., Strauss, M. J., & Wright, R. N. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_75 · Cited by 105
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Behm, A., Ji, S., Li, C., & Lu, J. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.32 · Cited by 73
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-citationA Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data
Xia, Z., Wang, X., Sun, X., & Wang, Q. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2401003 · Cited by 1,181
Self-citationSecure Ranked Keyword Search over Encrypted Cloud Data
Wang, C., Cao, N., Li, J., Ren, K., & Lou, W. (2010) · 2010 IEEE 30th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2010.34 · Cited by 732
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
Metadata
- Authors
- Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-5
- OpenAlex
- W2122590785
- Cited by
- 861
- References
- 11
- FWCI
- 25.99
- 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.