Hardening secure search in encrypted database: a KGA-resistance conjunctive searchable encryption scheme from lattice.

To cope with the local storage stress that has resulted from the increase in data volumes and to keep data privacy, users outsource their data to cloud servers after encrypting these data. Public key encryption with keyword search (PEKS) is a technique that can achieve the search function on encrypted data. However, most existing PEKS schemes are based on bilinear pairing which will be broken under the quantum computing attack. Moreover, the traditional PEKS schemes have an inherent security issue: They cannot resist the keywords guessing attack (KGA) which can cause devastating damage to the encrypted database. To address these problems, this paper proposes a KGA-resistance encrypted search scheme on lattice that is post-quantum secure. Furthermore, to achieve rich queries, our scheme is also designed to support the conjunctive query. Finally, the security analysis and performance evaluation are presented, which demonstrates that our scheme realizes a good balance between security and efficiency compared with related works. [ABSTRACT FROM AUTHOR]