a Fast Searchable Encryption Scheme Based on Dual Servers

With the rapid development of the Internet and cloud computing, storing massive amounts of data while ensuring the security of encryption and decryption as well as search performance has become a prominent issue in the industry. Traditional searchable encryption schemes generally suffer from offline internal keyword guessing attacks and exhibit low search efficiency. This paper proposes a fast searchable encryption scheme that can resist internal keyword guessing attacks. Firstly, through the cooperative work of dual servers, retrieval is performed using trapdoor information forwarded by the receiver, thus resisting offline keyword guessing attacks. Secondly, an efficient inverted index structure is introduced to achieve sub-linear search, where the search efficiency is only proportional to the number of ciphertexts containing the relevant query keywords, thereby enhancing efficiency.