Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings

Veronika Kuchta; Gaurav Sharma; Rajeev Anand Sahu; Olivier Markowitch

doi:10.1007/978-3-319-78556-1_5

Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings

Veronika Kuchta, Gaurav Sharma, Rajeev Anand Sahu, Olivier Markowitch

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

Abstract

We present constructions of CPA-secure (leveled) homomorphic encryption from learning with errors (LWE) problem. We use the construction introduced by Gentry, Sahai and Waters ‘GSW’ (CRYPTO’13) as building blocks of our schemes. We apply their approximate eigenvector method to our scheme. In contrast to the GSW scheme we provide extensions of the (leveled) homomorphic identity-based encryption (IBE) and (leveled) homomorphic attribute-based encryption (ABE) on the multi-identity and multi-attribute settings respectively. We realize the (leveled) homomorphic property for the multi-party setting by applying tensor product and natural logarithm. Tensor product and natural logarithm allow to evaluate different ciphertexts computed under different public keys. Similar to the GSW scheme, our constructions do not need any evaluation key, which enables evaluation even without the knowledge of user’s public key.

Original language	English
Title of host publication	Information Security and Cryptology - ICISC 2017
Subtitle of host publication	20th International Conference Seoul, South Korea, November 29 – December 1, 2017 Revised Selected Papers
Editors	Howon Kim, Dong-Chan Kim
Place of Publication	Cham Switzerland
Publisher	Springer
Pages	71-92
Number of pages	22
ISBN (Electronic)	9783319785561
ISBN (Print)	9783319785554
DOIs	https://doi.org/10.1007/978-3-319-78556-1_5
Publication status	Published - 2018
Externally published	Yes
Event	International Conference on Information Security and Cryptology 2017 - Seoul, Korea, South Duration: 29 Nov 2017 → 1 Dec 2017 Conference number: 20th https://link.springer.com/book/10.1007/978-3-319-78556-1 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	10779
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Information Security and Cryptology 2017
Abbreviated title	ICISC 2017
Country/Territory	Korea, South
City	Seoul
Period	29/11/17 → 1/12/17
Internet address	https://link.springer.com/book/10.1007/978-3-319-78556-1 (Proceedings)

Access to Document

10.1007/978-3-319-78556-1_5

Cite this

Kuchta, V., Sharma, G., Sahu, R. A., & Markowitch, O. (2018). Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings. In H. Kim, & D.-C. Kim (Eds.), Information Security and Cryptology - ICISC 2017: 20th International Conference Seoul, South Korea, November 29 – December 1, 2017 Revised Selected Papers (pp. 71-92). (Lecture Notes in Computer Science ; Vol. 10779 ). Springer. https://doi.org/10.1007/978-3-319-78556-1_5

Kuchta, Veronika ; Sharma, Gaurav ; Sahu, Rajeev Anand et al. / Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings. Information Security and Cryptology - ICISC 2017: 20th International Conference Seoul, South Korea, November 29 – December 1, 2017 Revised Selected Papers. editor / Howon Kim ; Dong-Chan Kim. Cham Switzerland : Springer, 2018. pp. 71-92 (Lecture Notes in Computer Science ).

@inproceedings{c4bb210d16594bf7b8c1e8e3ee6bb74e,

title = "Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings",

abstract = "We present constructions of CPA-secure (leveled) homomorphic encryption from learning with errors (LWE) problem. We use the construction introduced by Gentry, Sahai and Waters {\textquoteleft}GSW{\textquoteright} (CRYPTO{\textquoteright}13) as building blocks of our schemes. We apply their approximate eigenvector method to our scheme. In contrast to the GSW scheme we provide extensions of the (leveled) homomorphic identity-based encryption (IBE) and (leveled) homomorphic attribute-based encryption (ABE) on the multi-identity and multi-attribute settings respectively. We realize the (leveled) homomorphic property for the multi-party setting by applying tensor product and natural logarithm. Tensor product and natural logarithm allow to evaluate different ciphertexts computed under different public keys. Similar to the GSW scheme, our constructions do not need any evaluation key, which enables evaluation even without the knowledge of user{\textquoteright}s public key.",

author = "Veronika Kuchta and Gaurav Sharma and Sahu, {Rajeev Anand} and Olivier Markowitch",

year = "2018",

doi = "10.1007/978-3-319-78556-1_5",

language = "English",

isbn = "9783319785554",

series = "Lecture Notes in Computer Science ",

publisher = "Springer",

pages = "71--92",

editor = "Howon Kim and Dong-Chan Kim",

booktitle = "Information Security and Cryptology - ICISC 2017",

note = "International Conference on Information Security and Cryptology 2017, ICISC 2017 ; Conference date: 29-11-2017 Through 01-12-2017",

url = "https://link.springer.com/book/10.1007/978-3-319-78556-1",

}

Kuchta, V, Sharma, G, Sahu, RA & Markowitch, O 2018, Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings. in H Kim & D-C Kim (eds), Information Security and Cryptology - ICISC 2017: 20th International Conference Seoul, South Korea, November 29 – December 1, 2017 Revised Selected Papers. Lecture Notes in Computer Science , vol. 10779 , Springer, Cham Switzerland, pp. 71-92, International Conference on Information Security and Cryptology 2017, Seoul, Korea, South, 29/11/17. https://doi.org/10.1007/978-3-319-78556-1_5

Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings. / Kuchta, Veronika; Sharma, Gaurav; Sahu, Rajeev Anand et al.
Information Security and Cryptology - ICISC 2017: 20th International Conference Seoul, South Korea, November 29 – December 1, 2017 Revised Selected Papers. ed. / Howon Kim; Dong-Chan Kim. Cham Switzerland: Springer, 2018. p. 71-92 (Lecture Notes in Computer Science ; Vol. 10779 ).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

TY - GEN

T1 - Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings

AU - Kuchta, Veronika

AU - Sharma, Gaurav

AU - Sahu, Rajeev Anand

AU - Markowitch, Olivier

N1 - Conference code: 20th

PY - 2018

Y1 - 2018

N2 - We present constructions of CPA-secure (leveled) homomorphic encryption from learning with errors (LWE) problem. We use the construction introduced by Gentry, Sahai and Waters ‘GSW’ (CRYPTO’13) as building blocks of our schemes. We apply their approximate eigenvector method to our scheme. In contrast to the GSW scheme we provide extensions of the (leveled) homomorphic identity-based encryption (IBE) and (leveled) homomorphic attribute-based encryption (ABE) on the multi-identity and multi-attribute settings respectively. We realize the (leveled) homomorphic property for the multi-party setting by applying tensor product and natural logarithm. Tensor product and natural logarithm allow to evaluate different ciphertexts computed under different public keys. Similar to the GSW scheme, our constructions do not need any evaluation key, which enables evaluation even without the knowledge of user’s public key.

AB - We present constructions of CPA-secure (leveled) homomorphic encryption from learning with errors (LWE) problem. We use the construction introduced by Gentry, Sahai and Waters ‘GSW’ (CRYPTO’13) as building blocks of our schemes. We apply their approximate eigenvector method to our scheme. In contrast to the GSW scheme we provide extensions of the (leveled) homomorphic identity-based encryption (IBE) and (leveled) homomorphic attribute-based encryption (ABE) on the multi-identity and multi-attribute settings respectively. We realize the (leveled) homomorphic property for the multi-party setting by applying tensor product and natural logarithm. Tensor product and natural logarithm allow to evaluate different ciphertexts computed under different public keys. Similar to the GSW scheme, our constructions do not need any evaluation key, which enables evaluation even without the knowledge of user’s public key.

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

U2 - 10.1007/978-3-319-78556-1_5

DO - 10.1007/978-3-319-78556-1_5

M3 - Conference Paper

AN - SCOPUS:85044472314

SN - 9783319785554

T3 - Lecture Notes in Computer Science

SP - 71

EP - 92

BT - Information Security and Cryptology - ICISC 2017

A2 - Kim, Howon

A2 - Kim, Dong-Chan

PB - Springer

CY - Cham Switzerland

T2 - International Conference on Information Security and Cryptology 2017

Y2 - 29 November 2017 through 1 December 2017

ER -

Kuchta V, Sharma G, Sahu RA, Markowitch O. Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings. In Kim H, Kim DC, editors, Information Security and Cryptology - ICISC 2017: 20th International Conference Seoul, South Korea, November 29 – December 1, 2017 Revised Selected Papers. Cham Switzerland: Springer. 2018. p. 71-92. (Lecture Notes in Computer Science ). doi: 10.1007/978-3-319-78556-1_5

Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this