Abstract
Data stored in the cloud servers, keyword search, and access controls are two important capabilities which should be supported. Public-keyword encryption with keyword search (PEKS) and attribute based encryption (ABE) are corresponding solutions. Meanwhile, as we step into postquantum era, pairing related assumption is fragile. Lattice is an ideal choice for building secure encryption scheme against quantum attack. Based on this, we propose the first mathematical model for lattice-based authorized searchable encryption. Data owners can sort the ciphertext by specific keywords such as time; data users satisfying the access control hand the trapdoor generated with the keyword to the cloud sever; the cloud sever sends back the corresponding ciphertext. The security of our schemes is based on the worst-case hardness on lattices, called learning with errors (LWE) assumption. In addition, our scheme achieves attribute-hiding, which could protect the sensitive information of data user.
Highlights
Nowadays, more and more people use service from cloud server [1], which provides scalable and elastic storage and computation resources by the Internet
If data users want to extract the ciphertext from some time point, they only need to submit trapdoor corresponding to keyword the cloud server
We introduce the functionality of Public-keyword encryption with keyword search (PEKS) and ciphertext policy (CP)-attribute based encryption (ABE) independently
Summary
More and more people use service from cloud server [1], which provides scalable and elastic storage and computation resources by the Internet. To minimize the risk of data leakage to cloud service providers and protect data security and privacy, data owners choose to encrypt sensitive data, such as health records, and property information, before outsourcing it to the cloud, while retaining the decryption key by itself and other authorized users. Cloud server cannot be fully trusted by the data owner, so traditional server-based access control methods are no longer suitable solution for cloud computing. In order to address the problem of secure and decentralized access control, Sahai and Waters [2] proposed the concept of ABE by extending identity-based encryption, which achieved flexibility and one-to-many encryption and provided a fine-grained data sharing scheme. Waters [7] gave the first CP-ABE proved in the standard model supporting fully expressive access structure. Lattice is an ideal choice for building secure encryption scheme according to Mathematical Problems in Engineering
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
