Identity-based threshold encryption on lattices with application to searchable encryption

Veronika Kuchta, Olivier Markowitch

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationApplications and Techniques in Information Security
Subtitle of host publication6th International Conference, ATIS 2016 Cairns, QLD, Australia, October 26–28, 2016 Proceedings
EditorsLynn Batten, Gang Li
Place of PublicationSingapore
PublisherSpringer
Pages117-129
Number of pages13
ISBN (Electronic)9789811027413
ISBN (Print)9789811027406
DOIs
Publication statusPublished - 2016
Externally publishedYes
EventInternational Conference on Applications and Techniques in Information Security (ATIS) 2016 - Cairns, Australia
Duration: 26 Oct 201628 Oct 2016
Conference number: 6th
http://www.atis2016.conferences.academy/

Publication series

NameCommunications in Computer and Information Science
PublisherSpringere
Volume651
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937

Conference

ConferenceInternational Conference on Applications and Techniques in Information Security (ATIS) 2016
Abbreviated titleATIS 2016
CountryAustralia
CityCairns
Period26/10/1628/10/16
Internet address

Cite this

Kuchta, V., & Markowitch, O. (2016). Identity-based threshold encryption on lattices with application to searchable encryption. In L. Batten, & G. Li (Eds.), Applications and Techniques in Information Security: 6th International Conference, ATIS 2016 Cairns, QLD, Australia, October 26–28, 2016 Proceedings (pp. 117-129). (Communications in Computer and Information Science; Vol. 651). Singapore: Springer. https://doi.org/10.1007/978-981-10-2741-3_10
Kuchta, Veronika ; Markowitch, Olivier. / Identity-based threshold encryption on lattices with application to searchable encryption. Applications and Techniques in Information Security: 6th International Conference, ATIS 2016 Cairns, QLD, Australia, October 26–28, 2016 Proceedings. editor / Lynn Batten ; Gang Li. Singapore : Springer, 2016. pp. 117-129 (Communications in Computer and Information Science).
@inproceedings{8a1a132cd0c54f73a6380eb82c76f206,
title = "Identity-based threshold encryption on lattices with application to searchable encryption",
abstract = "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.",
author = "Veronika Kuchta and Olivier Markowitch",
year = "2016",
doi = "10.1007/978-981-10-2741-3_10",
language = "English",
isbn = "9789811027406",
series = "Communications in Computer and Information Science",
publisher = "Springer",
pages = "117--129",
editor = "Lynn Batten and Gang Li",
booktitle = "Applications and Techniques in Information Security",

}

Kuchta, V & Markowitch, O 2016, Identity-based threshold encryption on lattices with application to searchable encryption. in L Batten & G Li (eds), Applications and Techniques in Information Security: 6th International Conference, ATIS 2016 Cairns, QLD, Australia, October 26–28, 2016 Proceedings. Communications in Computer and Information Science, vol. 651, Springer, Singapore, pp. 117-129, International Conference on Applications and Techniques in Information Security (ATIS) 2016, Cairns, Australia, 26/10/16. https://doi.org/10.1007/978-981-10-2741-3_10

Identity-based threshold encryption on lattices with application to searchable encryption. / Kuchta, Veronika; Markowitch, Olivier.

Applications and Techniques in Information Security: 6th International Conference, ATIS 2016 Cairns, QLD, Australia, October 26–28, 2016 Proceedings. ed. / Lynn Batten; Gang Li. Singapore : Springer, 2016. p. 117-129 (Communications in Computer and Information Science; Vol. 651).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

TY - GEN

T1 - Identity-based threshold encryption on lattices with application to searchable encryption

AU - Kuchta, Veronika

AU - Markowitch, Olivier

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84989810260&partnerID=8YFLogxK

U2 - 10.1007/978-981-10-2741-3_10

DO - 10.1007/978-981-10-2741-3_10

M3 - Conference Paper

SN - 9789811027406

T3 - Communications in Computer and Information Science

SP - 117

EP - 129

BT - Applications and Techniques in Information Security

A2 - Batten, Lynn

A2 - Li, Gang

PB - Springer

CY - Singapore

ER -

Kuchta V, Markowitch O. Identity-based threshold encryption on lattices with application to searchable encryption. In Batten L, Li G, editors, Applications and Techniques in Information Security: 6th International Conference, ATIS 2016 Cairns, QLD, Australia, October 26–28, 2016 Proceedings. Singapore: Springer. 2016. p. 117-129. (Communications in Computer and Information Science). https://doi.org/10.1007/978-981-10-2741-3_10