Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control
-
Published:2024-02-02
Issue:1
Volume:13
Page:12
-
ISSN:2224-2708
-
Container-title:Journal of Sensor and Actuator Networks
-
language:en
-
Short-container-title:JSAN
Author:
Bulbul Salim Sabah1, Abduljabbar Zaid Ameen2, Najem Duaa Fadhel3, Nyangaresi Vincent Omollo4ORCID, Ma Junchao5ORCID, Aldarwish Abdulla J. Y.2ORCID
Affiliation:
1. Directorate General of Education Basra, Ministry of Education, Basra 61004, Iraq 2. Department of Computer Science, College of Education for Pure Sciences, University of Basrah, Basrah 61004, Iraq 3. Department of Cyber Security, College of Computer Science and Information Technology, University of Basrah, Basrah 61004, Iraq 4. Department of Computer Science and Software Engineering, Jaramogi Oginga Odinga University of Science & Technology, Bondo 40601, Kenya 5. College of Big Data and Internet, Shenzhen Technology University, Shenzhen 518118, China
Abstract
Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal concepts of privacy within dynamic searchable symmetric encryption (DSSE) schemes: forward privacy and backward privacy. The former serves as a safeguard against the linkage of recently added documents to previously conducted search queries, whereas the latter guarantees the irretrievability of deleted documents in subsequent search inquiries. However, the provision of fine-grained access control is complex in existing multi-user SSE schemes. SSE schemes may also incur high computation costs due to the need for fine-grained access control, and it is essential to support document updates and forward privacy. In response to these issues, this paper suggests a searchable encryption scheme that uses simple primitive tools. We present a multi-user SSE scheme that efficiently controls access to dynamically encrypted documents to resolve these issues, using an innovative approach that readily enhances previous findings. Rather than employing asymmetric encryption as in comparable systems, we harness low-complexity primitive encryption tools and inverted index-based DSSE to handle retrieving encrypted files, resulting in a notably faster system. Furthermore, we ensure heightened security by refreshing the encryption key after each search, meaning that users are unable to conduct subsequent searches with the same key and must obtain a fresh key from the data owner. An experimental evaluation shows that our scheme achieves forward and Type II backward privacy and has much faster search performance than other schemes. Our scheme can be considered secure, as proven in a random oracle model.
Funder
Natural Science Foundation of Top Talent of SZTU
Subject
Control and Optimization,Computer Networks and Communications,Instrumentation
Reference31 articles.
1. Lightweight secure message delivery for E2E S2S communication in the IoT-cloud system;Lu;IEEE Access,2020 2. Abduljabbar, Z.A., Jin, H., Ibrahim, A., Hussien, Z.A., Hussain, M.A., Abbdal, S.H., and Zou, D. (2016, January 5–8). Secure Biometric Image Retrieval in IoT-Cloud. Proceedings of the 2016 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC), Hong Kong, China. 3. Provably throttling SQLI using an enciphering query and secure matching;Hussain;Egypt. Inform. J.,2022 4. Abduljabbar, Z.A., Jin, H., Ibrahim, A., Hussien, Z.A., Hussain, M.A., Abbdal, S.H., and Zou, D. (2016). Sepim: Secure and efficient private image matching. Appl. Sci., 6. 5. Song, D.X., Wagner, D., and Perrig, A. (2000, January 14–17). Practical Techniques for Searches on Encrypted Data. Proceedings of the 2000 IEEE Symposium on Security and Privacy, S&P 2000, Berkeley, CA, USA.
|
|