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 ciphertextsearch directly. In terms of multiuser 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. INDEX TERMS Lattices, attribute-based encryption (ABE), public-key encryption with keyword search (PEKS), learning with errors (LWE).

Secure ABE Scheme for Access Management in Blockchain-Based IoT

“…[34] and Ref. [35], the sizes of the public key, private key and ciphertext in our scheme are shorter than that in other schemes. It can decrease computational complexity of our proposed cryptocurrency scheme.…”

“…Afterwards, in 2018, Wang et al designed a ABE scheme with revocation support and flexible access structure on lattice by using binary tree [34]. In 2019, Liu et al proposed a KS-ABE scheme to strength ciphertextsearch security for cloud storage [35]. However, due to the high ciphertext expansion rate, the size of the ciphertext is large.…”

Keyword Semantic Extended Top-k Ciphertext Retrieval Scheme Over Hybrid Government Cloud Environment

“…Literature [15]- [18] conducted a series of technical improvement studies on the shortcomings of previous searchable encryption technology schemes. Combined with the theory of attribute encryption and lattice cryptography, literature [19], which takes into account the problem of data security storage and search. However, most of the existing relevant research results are for the implementation of single or a few specified input keywords as retrieval requests over the public cloud environment.…”

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

“…Yu et al [47] extended tree structure to support AND, OR and threshold gates as LSSS matrix in the KP-ABE scheme. Liu et al [48] extended KP-ABE in a keywordsearchable context, whereas Liu et al [49] focused on addressing the leakage of shared master keys in LSSS. Luo et al [50] applied proxy re-encryption concepts in solving the forward and backward secrecy of the KP-ABE scheme.…”

“…Pal and Dutta [51] further extended the KP-ABE scheme in supporting functional encryption. Generally, the algorithm design of recent quantum-resistant KP-ABE schemes [24,[41][42][43][44][45][46][47][48][49][50][51] is mainly directed at lattice-based cryptography, which offers security proofs based on NP-hard problems with average-case to worst-case hardness. Moreover, the inherent linear algebra-based matrix or vector operations make lattice-based ABE can be implemented efficiently [15].…”