Two Searchable Encryption Schemes That Can Resist Keyword Guessing Attacks

In order to reduce the heavy burden of storing and managing data,more and more companies or individuals are willing to outsource local data to cloud service providers,but this also causes great inconvenience for users to search for encrypted data stored in the cloud service.For the purpose of solving the problem that users search for encrypted data,the concept of searchable encryption was proposed.However,many searchable encryption schemes that have been proposed cannot effectively resist an attack called "keyword guessing attacks".Therefore,this paper proposes two searchable encryption schemes that can resist keyword guessing attacks,whose main content is as follow:(1)Aiming at the problem that some existing searchable encryption schemes cannot resist keyword guessing attacks,this paper proposes a searchable encryption scheme that can successfully resist keyword guessing attacks.In the proposed new scheme,the sender and receiver can obtain a common key through Diffie-Hellman key agreement scheme,and use the key to generate keyword ciphertext and trapdoor,so as to achieve the purpose of enabling the scheme to successfully resist keyword guessing attacks.In addition,in the process of constructing new scheme,we consider to let the cloud server with strong computing capacity bear the operation of bilinear pair with large computing cost as much as possible,so the sender and receiver only need to bear low computing cost.(2)In view of the problem that some searchable encryption schemes cannot resist keyword guessing attacks and the high cost of encrypting keywords by data owners in multi-user scenarios,this paper proposes a searchable encryption scheme that can resist keyword guessing attacks in multi-user scenarios.In the scheme,the data owner can obtain different common keys with each user in the group based on Diffie-Hellman key agreement scheme,and process the keys and keywords to be encrypted through a secure hash function,which makes the scheme realize the function of multi-user searching and security against keyword guessing attacks.In addition,since we did not use the time-consuming bilinear pair operation in the new scheme,the new scheme has the advantage of low computational cost.