The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement
Abstract
Keyword-based search over encrypted outsourced data has become an important tool in the current cloud computing scenario. The majority of the existing techniques are focusing on multi-keyword exact match or single keyword fuzzy search. However, those existing techniques find less practical significance in real-world applications compared with the multi-keyword fuzzy search technique over encrypted data. The first attempt to construct such a multi-keyword fuzzy search scheme was reported by Wang et al., who used locality-sensitive hashing functions and Bloom filtering to meet the goal of multi-keyword fuzzy search. Nevertheless, Wang's scheme was only effective for a one letter mistake in keyword but was not effective for other common spelling mistakes. Moreover, Wang's scheme was vulnerable to server out-of-order problems during the ranking process and did not consider the keyword weight. In this paper, based on Wang et al.'s scheme, we propose an efficient multi-keyword fuzzy ranked search scheme based on Wang et al.'s scheme that is able to address the aforementioned problems. First, we develop a new method of keyword transformation based on the uni-gram, which will simultaneously improve the accuracy and creates the ability to handle other spelling mistakes. In addition, keywords with the same root can be queried using the stemming algorithm. Furthermore, we consider the keyword weight when selecting an adequate matching file set. Experiments using real-world data show that our scheme is practically efficient and achieve high accuracy.
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
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096 · cited 2×
“1) Stemming Algorithm: A stemming algorithm [20], [21] is a process of linguistic normalisation, in which the variant forms of a word are reduced to a common form.”
BackgroundMethodSpace/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
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
Locality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. S. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997857 · Cited by 2,936
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
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
A 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-citationDevelopment of a Stemming Algorithm
Lovins, J. B. (1968) · Mech. Transl. Comput. Linguistics · Cited by 1,115
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
Cited by
Data Security and Privacy Protection for Cloud Storage: A Survey
Yang, P., Xiong, N., & Ren, J. (2020) · IEEE Access · doi:10.1109/access.2020.3009876 · Cited by 502
A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm
Deng, W., Yao, R., Zhao, H., Yang, X., & Li, G. (2019) · Soft Computing · doi:10.1007/s00500-017-2940-9 · Cited by 490
A Survey on Energy Internet: Architecture, Approach, and Emerging Technologies
Wang, K., Yu, J., Yu, Y., Qian, Y., Zeng, D., Guo, S., Xiang, Y., & Wu, J. (2018) · IEEE Systems Journal · doi:10.1109/jsyst.2016.2639820 · Cited by 374
Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment
Deng, W., Zhao, H., Yang, X., Xiong, J., Sun, M., & Li, B. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.06.004 · Cited by 364
A survey of distributed denial-of-service attack, prevention, and mitigation techniques
Mahjabin, T., Xiao, Y., Sun, G., & Jiang, W. (2017) · International Journal of Distributed Sensor Networks · doi:10.1177/1550147717741463 · Cited by 327
Metadata
- Authors
- Fu, Z., Wu, X., Guan, C., Sun, X., & Ren, K.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2016-12
- Volume
- 11
- Issue
- 12
- Pages
- 2706-2716
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2490265015
- Cited by
- 547
- References
- 25
- FWCI
- 96.82
- 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: Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement. https://app.cochat.ai/papers/10.1109/tifs.2016.2596138
- The paper
- Fu, Z., Wu, X., Guan, C., Sun, X., & Ren, K. (2016). Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2016.2596138
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.