The DOI matches its Crossref record.
Verifiable Privacy-Preserving Multi-Keyword Text Search in the Cloud Supporting Similarity-Based Ranking
Abstract
With the growing popularity of cloud computing, huge amount of documents are outsourced to the cloud for reduced management cost and ease of access. Although encryption helps protecting user data confidentiality, it leaves the well-functioning yet practically-efficient secure search functions over encrypted data a challenging problem. In this paper, we present a verifiable privacy-preserving multi-keyword text search (MTS) scheme with similarity-based ranking to address this problem. To support multi-keyword search and search result ranking, we propose to build the search index based on term frequency- and the vector space model with cosine similarity measure to achieve higher search result accuracy. To improve the search efficiency, we propose a tree-based index structure and various adaptive methods for multi-dimensional (MD) algorithm so that the practical search efficiency is much better than that of linear search. To further enhance the search privacy, we propose two secure index schemes to meet the stringent privacy requirements under strong threat models, i.e., known ciphertext model and known background model. In addition, we devise a scheme upon the proposed index tree structure to enable authenticity check over the returned search results. Finally, we demonstrate the effectiveness and efficiency of the proposed schemes through extensive experimental evaluation.
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
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
Blockchain based searchable encryption for electronic health record sharing
Chen, L., Lee, W.-K., Chang, C.-C., Choo, K.-K. R., & Zhang, N. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.01.018 · Cited by 484
Sun, W., Yu, S., Lou, W., Hou, Y. T., & Li, H. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2355202 · Cited by 351
Self-citationLi, H., Yang, Y., Luan, T. H., Liang, X., Zhou, L., & Shen, X. S. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2406704 · Cited by 274
Self-citationCountering Statistical Attacks in Cloud-Based Searchable Encryption
Ahsan, M. A. M., Ali, I., Bin Idris, M. Y. I., Imran, M., & Shoaib, M. (2020) · International Journal of Parallel Programming · doi:10.1007/s10766-018-0584-8 · Cited by 9
Metadata
- Authors
- Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y. T., & Li, H.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2014-11
- Volume
- 25
- Issue
- 11
- Pages
- 3025-3035
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2148997402
- Cited by
- 214
- References
- 0
- FWCI
- 13.25
- 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: Verifiable Privacy-Preserving Multi-Keyword Text Search in the Cloud Supporting Similarity-Based Ranking. https://app.cochat.ai/papers/10.1109/tpds.2013.282
- The paper
- Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y. T., & Li, H. (2014). Verifiable Privacy-Preserving Multi-Keyword Text Search in the Cloud Supporting Similarity-Based Ranking. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2013.282
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.