A Keyword-Searchable ABE Scheme From Lattice in Cloud Storage Environment

Abstract

Currently, the security situation of data security and user privacy protection is increasingly serious in cloud environment. Ciphertext data storage can prevent the risk of user's privacy disclosure. But how to search keyword on ciphertext data without revealing keyword information becomes a new challenge. Searchable encryption (SE) is put forward for this reason, which can be used to realize ciphertext-search directly. In terms of multi-user data sharing, public-key encryption with keywords search (PEKS) is more widely used than symmetric searchable encryption. PEKS has been widely studied and developed by researchers in recent years. However, the existing PEKS scheme often lacks flexible access policy. Therefore, combining the advantage of policy control on attribute-based encryption (ABE), and as that the bilinear pairing related assumption is fragile in post-quantum era, lattice-based cryptography is considered as one of secure encryption technology against quantum attack. With this background, in this paper, we give a keyword-searchable ABE scheme based on the hardness of lattice problems, our scheme supports flexible attribute control policy by integrating ABE and PEKS, and the security of new scheme is proved under the learning with errors (LWE) assumption. As lattice-based cryptographic technology is currently thought to be resistant to quantum attacks, so the new scheme has stronger security in a quantum era.

Keywords

• Lattices
• attribute-based encryption (ABE)
• public-key encryption with keyword search (PEKS)
• learning with errors (LWE)