EDSEBS: A NOVEL APPROACH FOR ENHANCED DUAL-SERVER ENCRYPTED BOOLEAN SEARCH IN CLOUD SYSTEMS

Abstract

The Enhanced Dual-Server Encrypted Boolean Search (EDSEBS) supports privacy-preserving search on secure file-sharing systems with a two-server model. One server is utilized for storing encrypted indexes and the other for storing encrypted files so that neither can own user data in full. With homomorphic encryption and oblivious transfer, the scheme supports secure Boolean keyword searching (AND, OR, NOT) with low computational overheads and high security levels. In contrast to standard encrypted search processes, EDSEBS effectively scales workloads between two servers with improved query efficiency, scalability, and security. Experimental results validate that EDSEBS runs faster than Homomorphic Encryption and Oblivious Transfer in execution time but with robust privacy protection. The indexing technique employed reduces query response time to support real-time searching of large volumes of data. It has dynamic updates without the need for reindexing the entire data set, therefore making it applicable in secure cloud storage and commercial use. EDSEBS resists server-based attacks by eliminating unauthorized search pattern and sensitive information access. From the performance evaluation, it indicates that it has faster encryption, decryption, upload, and download times than other traditional methods. It also comes with a secure user authentication scheme to ensure legitimate users can download the encrypted data. Its lightweight and optimized crypt structure enables fast execution without sacrificing security. The easy-to-use file-sharing interface provides request-based access control, contributing to the security. This is a very practical solution in privacy-sensitive areas such as medical records, legal documents, and business data. In general, EDSEBS offers an encrypted search and file retrieval approach that is fast, scalable, and secure in cloud environments.