Identity-Based Threshold Encryption on Lattices with Application to Searchable Encryption
As more Internet users are getting interested in using cloud services for storing sensitive data, it motivates the user to encrypt the private data before uploading it to the cloud. There are services which allow an user to conduct searches without reveal
- PDF / 310,761 Bytes
- 13 Pages / 439.37 x 666.142 pts Page_size
- 26 Downloads / 214 Views
stract. As more Internet users are getting interested in using cloud services for storing sensitive data, it motivates the user to encrypt the private data before uploading it to the cloud. There are services which allow an user to conduct searches without revealing anything about the encrypted data. This service is provided by public key encryption with keyword search. Our main contributions is the construction of a latticebased identity-based threshold decryption (IBTD) that is anonymous and indistinguishable against chosen ciphertext attacks. Furthermore, using the transformation technique from Abdalla et al. [CRYPTO’05] we present the application of our IBTD scheme which can be transformed to a distributed public key encryption with keyword search. The distributed setting allows to split the role of one server into multiple servers in order to distribute the single point of failure. Our construction uses the particularly efficient mathematical construct, called lattices that make our scheme resistant against quantum attacks. We give an efficient construction of a lattice-based IBTD scheme and prove it secure under the hardness of learning with errors (LWE) problem.
1
Introduction
Cloud Computing. Since its invention, cloud computing became an important application for the recent cryptographic community which works on the newest security challenges and provides crucial security protocols for the nowadays common cloud services. Storing data in a cloud system enables users to reduce purchase and maintaining cost of computing and storage tools. These services attract a huge attention from Internet users. When personal and confidential data is outsourced to a cloud server, the customers are especially concerned about privacy and confidentiality of their data. They interested in certain services which guarantee their data will not be watched or accessed by anybody. There are distinct cloud scenarios where cloud service users might be interested in uploading some certain and specific data files, without retrieving the complete data stored in the cloud. In order to provide efficient tasks for aforementioned cloud services, cryptographers develop several protocols we recall in the following paragraphs. Since our main contribution is based on the well-known mathematical construct – lattices – we provide first an overview of lattice-based cryptoschemes and of their significant role in current cryptographic challenges. c Springer Nature Singapore Pte Ltd. 2016 L. Batten and G. Li (Eds.): ATIS 2016, CCIS 651, pp. 117–129, 2016. DOI: 10.1007/978-981-10-2741-3 10
118
V. Kuchta and O. Markowitch
Lattice-Based Cryptosystems. Lattice-Based Cryptography represents another topic which attracts a lot of interests from researchers. Cryptographic schemes based on lattices have especially attractive features as stated in [23]. The best attacks of lattice-based schemes require exponential time in security parameter, even for a quantum adversary, where the classic factoring-based cryptographic schemes can be broken in subexponential time or
Data Loading...
