Chosen-ciphertext secure fully homomorphic encryption

Ran Canetti; Srinivasan Raghuraman; Silas Richelson; Vinod Vaikuntanathan

doi:10.1007/978-3-662-54388-7_8

Chosen-ciphertext secure fully homomorphic encryption

Ran Canetti, Srinivasan Raghuraman, Silas Richelson^*, Vinod Vaikuntanathan

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

61 Scopus citations

Abstract

We give three fully homomoprhic encryption (FHE) schemes that are secure against non-adaptive chosen ciphertext attacks (CCA1). For the first two, we extend the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE scheme. We then show two instantiations of multikey identity-based FHE: One from LWE in the random oracle model, and one from sub-exponentially secure indistinguishability obfuscation. Both constructions are compact with respect to the function evaluated homomorphically but not compact with respect to the number of ciphertext involved in the homomorphic evaluation. The third scheme uses succinct non-interactive arguments of knowledge (SNARKs) and is fully compact.

Original language	English
Title of host publication	Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
Editors	Serge Fehr
Publisher	Springer Verlag
Pages	213-240
Number of pages	28
ISBN (Print)	9783662543870
DOIs	https://doi.org/10.1007/978-3-662-54388-7_8
State	Published - 2017
Event	20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017 - Amsterdam, Netherlands Duration: 28 Mar 2017 → 31 Mar 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10175 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017
Country/Territory	Netherlands
City	Amsterdam
Period	28/03/17 → 31/03/17

Funding

Funders	Funder number
Microsoft Faculty Fellowship
National Science Foundation	CNS-1413964, CNS-1350619
Defense Advanced Research Projects Agency
Alfred P. Sloan Foundation
U.S. Army	W911NF-15-C-0236, W911NF-15-C-0226
Massachusetts Institute of Technology	6-5-12
Israel Science Foundation

Access to Document

10.1007/978-3-662-54388-7_8

Cite this

Canetti, R., Raghuraman, S., Richelson, S., & Vaikuntanathan, V. (2017). Chosen-ciphertext secure fully homomorphic encryption. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (pp. 213-240). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10175 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-54388-7_8

Canetti, Ran ; Raghuraman, Srinivasan ; Richelson, Silas et al. / Chosen-ciphertext secure fully homomorphic encryption. Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. editor / Serge Fehr. Springer Verlag, 2017. pp. 213-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f26279a29c684f2e9ec650f6268906a0,

title = "Chosen-ciphertext secure fully homomorphic encryption",

abstract = "We give three fully homomoprhic encryption (FHE) schemes that are secure against non-adaptive chosen ciphertext attacks (CCA1). For the first two, we extend the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE scheme. We then show two instantiations of multikey identity-based FHE: One from LWE in the random oracle model, and one from sub-exponentially secure indistinguishability obfuscation. Both constructions are compact with respect to the function evaluated homomorphically but not compact with respect to the number of ciphertext involved in the homomorphic evaluation. The third scheme uses succinct non-interactive arguments of knowledge (SNARKs) and is fully compact.",

author = "Ran Canetti and Srinivasan Raghuraman and Silas Richelson and Vinod Vaikuntanathan",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2017.; 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017 ; Conference date: 28-03-2017 Through 31-03-2017",

year = "2017",

doi = "10.1007/978-3-662-54388-7_8",

language = "אנגלית",

isbn = "9783662543870",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "213--240",

editor = "Serge Fehr",

booktitle = "Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings",

}

Canetti, R, Raghuraman, S, Richelson, S & Vaikuntanathan, V 2017, Chosen-ciphertext secure fully homomorphic encryption. in S Fehr (ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10175 LNCS, Springer Verlag, pp. 213-240, 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017, Amsterdam, Netherlands, 28/03/17. https://doi.org/10.1007/978-3-662-54388-7_8

Chosen-ciphertext secure fully homomorphic encryption. / Canetti, Ran; Raghuraman, Srinivasan; Richelson, Silas et al.
Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. ed. / Serge Fehr. Springer Verlag, 2017. p. 213-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10175 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Chosen-ciphertext secure fully homomorphic encryption

AU - Canetti, Ran

AU - Raghuraman, Srinivasan

AU - Richelson, Silas

AU - Vaikuntanathan, Vinod

PY - 2017

Y1 - 2017

N2 - We give three fully homomoprhic encryption (FHE) schemes that are secure against non-adaptive chosen ciphertext attacks (CCA1). For the first two, we extend the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE scheme. We then show two instantiations of multikey identity-based FHE: One from LWE in the random oracle model, and one from sub-exponentially secure indistinguishability obfuscation. Both constructions are compact with respect to the function evaluated homomorphically but not compact with respect to the number of ciphertext involved in the homomorphic evaluation. The third scheme uses succinct non-interactive arguments of knowledge (SNARKs) and is fully compact.

AB - We give three fully homomoprhic encryption (FHE) schemes that are secure against non-adaptive chosen ciphertext attacks (CCA1). For the first two, we extend the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE scheme. We then show two instantiations of multikey identity-based FHE: One from LWE in the random oracle model, and one from sub-exponentially secure indistinguishability obfuscation. Both constructions are compact with respect to the function evaluated homomorphically but not compact with respect to the number of ciphertext involved in the homomorphic evaluation. The third scheme uses succinct non-interactive arguments of knowledge (SNARKs) and is fully compact.

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

U2 - 10.1007/978-3-662-54388-7_8

DO - 10.1007/978-3-662-54388-7_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85014501169

SN - 9783662543870

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 213

EP - 240

BT - Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings

A2 - Fehr, Serge

PB - Springer Verlag

T2 - 20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017

Y2 - 28 March 2017 through 31 March 2017

ER -

Canetti R, Raghuraman S, Richelson S, Vaikuntanathan V. Chosen-ciphertext secure fully homomorphic encryption. In Fehr S, editor, Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings. Springer Verlag. 2017. p. 213-240. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-54388-7_8

Chosen-ciphertext secure fully homomorphic encryption

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this