The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement
Abstract
In cloud computing, searchable encryption scheme over outsourced data is a hot research field. However, most existing works on encrypted search over outsourced cloud data follow the model of “one size fits all” and ignore personalized search intention. Moreover, most of them support only exact keyword search, which greatly affects data usability and user experience. So how to design a searchable encryption scheme that supports personalized search and improves user search experience remains a very challenging task. In this paper, for the first time, we study and solve the problem of personalized multi-keyword ranked search over encrypted data (PRSE) while preserving privacy in cloud computing. With the help of semantic ontology WordNet, we build a user interest model for individual user by analyzing the user's search history, and adopt a scoring mechanism to express user interest smartly. To address the limitations of the model of “one size fit all” and keyword exact search, we propose two PRSE schemes for different search intentions. Extensive experiments on real-world dataset validate our analysis and show that our proposed solution is very efficient and effective.
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
WordNet: a lexical database for English
Miller, G. A. (1995) · Communications of the ACM · doi:10.1145/219717.219748 · Cited by 14,015 · cited 1×
“WordNet [20] is a lexical database available online, which offers a large repository of English lexical items.”
BackgroundAn algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096 · cited 1×
“In our experiments, we choose a publicly available real dataset: the Enron Dataset [27] and also try to get the root of every keyword with a well known stemming technique called Porter Stemming Algorithm [30].”
MethodPractical 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
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-citationChor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116
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
Searchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
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
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_20 · Cited by 883
Fuzzy Keyword Search over Encrypted Data in Cloud Computing
Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462196 · Cited by 861
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-citationPrivacy-preserving multi-keyword ranked search over encrypted cloud data
Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935306 · Cited by 500
Self-citationAccess Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation.
Islam, M. S., Kuzu, M., & Kantarcıoğlu, M. (2012) · Cited by 491
Context-sensitive information retrieval using implicit feedback
Shen, X., Tan, B., & Zhai, C. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076045 · Cited by 436
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
Web search personalization with ontological user profiles
Sieg, A., Mobasher, B., & Burke, R. (2007) · Proceedings of the sixteenth ACM conference on Conference on information and knowledge management · doi:10.1145/1321440.1321515 · Cited by 324
The Enron Email Dataset Database Schema and Brief Statistical Report
Shetty, J., & Adibi, J. (2004) · Cited by 315
Achieving usable and privacy-assured similarity search over outsourced cloud data
Wang, C., Ren, K., Yu, S., & Urs, K. M. R. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195784 · Cited by 280
Self-citationInterest-based personalized search
Ma, Z., Pant, G., & Sheng, O. R. L. (2007) · ACM Transactions on Information Systems · doi:10.1145/1198296.1198301 · Cited by 162
Fu, Z., Sun, X., Linge, N., et al. (2014) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2014.6780939 · Cited by 129
Self-citationFan, W., Gordon, M. D., & Pathak, P. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1269663 · Cited by 88
Cited by
Energy-Efficient Offloading for Mobile Edge Computing in 5G Heterogeneous Networks
Zhang, K., Mao, Y., Leng, S., Zhao, Q., Li, L., Peng, X., Pan, L., Maharjan, S., & Zhang, Y. (2016) · IEEE Access · doi:10.1109/access.2016.2597169 · Cited by 855
Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems
Wang, G.-G. (2018) · Memetic Computing · doi:10.1007/s12293-016-0212-3 · Cited by 780
A Privacy-Preserving and Copy-Deterrence Content-Based Image Retrieval Scheme in Cloud Computing
Xia, Z., Wang, X., Zhang, L., Qin, Z., Sun, X., & Ren, K. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2590944 · Cited by 685
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
Self-citationA 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
Metadata
- Authors
- Fu, Z., Ren, K., Shu, J., Sun, X., & Huang, F.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2016-09-01
- Volume
- 27
- Issue
- 9
- Pages
- 2546-2559
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2344811709
- Cited by
- 696
- References
- 23
- FWCI
- 155.16
- 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
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.