The DOI matches its Crossref record.
Confidentiality-preserving rank-ordered search
Abstract
This paper introduces a new framework for confidentiality preserving rank-ordered search and retrieval over large document collections. The proposed framework not only protects document/query confidentiality against an outside intruder, but also prevents an untrusted data center from learning information about the query and the document collection. We present practical techniques for proper integration of relevance scoring methods and cryptographic techniques, such as order preserving encryption, to protect data collections and indices and provide efficient and accurate search capabilities to securely rank-order documents in response to a query. Experimental results on the W3C collection show that these techniques have comparable performance to conventional search systems designed for non-encrypted data in terms of search accuracy. The proposed methods thus form the first steps to bring together advanced information retrieval and secure search capabilities for a wide range of applications including managing data in government and business operations, enabling scholarly study of sensitive data, and facilitating the document discovery process in litigation.
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
Secure 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
Enabling 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
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y. T., & Li, H. (2013) · Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security · doi:10.1145/2484313.2484322 · Cited by 338
Countering 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
- Swaminathan, A., Mao, Y., Su, G.-M., Gou, H., Varna, A. L., He, S., Wu, M., & Oard, D. W.
- Venue
- Proceedings of the 2007 ACM workshop on Storage security and survivability
- Publisher
- ACM
- Published
- 2007-10-29
- Pages
- 7-12
- OpenAlex
- W2112064109
- Cited by
- 162
- References
- 0
- FWCI
- 1.30
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Confidentiality-preserving rank-ordered search. https://app.cochat.ai/papers/10.1145/1314313.1314316
- The paper
- Swaminathan, A., Mao, Y., Su, G.-M., Gou, H., Varna, A. L., He, S., Wu, M., & Oard, D. W. (2007). Confidentiality-preserving rank-ordered search. Proceedings of the 2007 ACM workshop on Storage security and survivability. https://doi.org/10.1145/1314313.1314316
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.