Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Using cloud computing, individuals can store their data on remote servers and allow data access to public users through the cloud servers. As the outsourced data are likely to contain sensitive privacy information, they are typically encrypted before uploaded to the cloud. This, however, significantly limits the usability of outsourced data due to the difficulty of searching over the encrypted data. In this paper, we address this issue by developing the fine-grained multi-keyword search schemes over encrypted cloud data. Our original contributions are three-fold. First, we introduce the relevance scores and preference factors upon keywords which enable the precise keyword search and personalized user experience. Second, we develop a practical and very efficient multi-keyword search scheme. The proposed scheme can support complicated logic search the mixed “AND”, “OR” and “NO” operations of keywords. Third, we further employ the classified sub-dictionaries technique to achieve better efficiency on index building, trapdoor generating and query. Lastly, we analyze the security of the proposed schemes in terms of confidentiality of documents, privacy protection of index and trapdoor, and unlinkability of trapdoor. Through extensive experiments using the real-world dataset, we validate the performance of the proposed schemes. Both the security analysis and experimental results demonstrate that the proposed schemes can achieve the same security level comparing to the existing ones and better performance in terms of functionality, query complexity and efficiency.
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
Cryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
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
Cryptography: Theory and practice
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90225-2 · Cited by 1,367
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
Secure kNN computation on encrypted databases
Wong, W. K., Cheung, D. W.-L., Kao, B., & Mamoulis, N. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559862 · Cited by 901
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
Secure 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
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
Cited by
Internet of vehicles in big data era
Xu, W., Zhou, H., Cheng, N., Lyu, F., Shi, W., Chen, J., & Shen, X. (2018) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2017.7510736 · Cited by 565
Self-citationToward 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
Towards Efficient and Privacy-Preserving Federated Deep Learning
Hao, M., Li, H., Xu, G., Liu, S., & Yang, H. (2019) · ICC 2019 - 2019 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2019.8761267 · Cited by 187
“Consider a situation in realworld, medical institutions often need datasets such as the physiological characteristics of cancer patients for deep learning to obtain the best therapeutic effect [6] [7].”
BackgroundSelf-citationPrivacy-aware and Resource-saving Collaborative Learning for Healthcare in Cloud Computing
Hao, M., Li, H., Xu, G., Liu, Z., & Chen, Z. (2020) · ICC 2020 - 2020 IEEE International Conference on Communications (ICC) · doi:10.1109/icc40277.2020.9148979 · Cited by 52
“In general, conducting a predictive model requires an enormous amount of medical data that includes a lot of sensitive information [3] [4].”
Self-citationAchieving Privacy-preserving Federated Learning with Irrelevant Updates over E-Health Applications
Chen, H., Li, H., Xu, G., Zhang, Y., & Luo, X. (2020) · ICC 2020 - 2020 IEEE International Conference on Communications (ICC) · doi:10.1109/icc40277.2020.9149385 · Cited by 43
“However, studies have shown that adversaries can still get original information of owners based on shared gradients [12] [13].”
BackgroundSelf-citation
Metadata
- Authors
- Li, H., Yang, Y., Luan, T. H., Liang, X., Zhou, L., & Shen, X. S.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2016-05-01
- Volume
- 13
- Issue
- 3
- Pages
- 312-325
- ISSN
- 1545-5971 (ISSN-L)
- OpenAlex
- W2147096042
- Cited by
- 274
- References
- 24
- FWCI
- 39.73
- Type
- journal article
- Language
- en
- Open access
- diamond
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.