Name
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 multi-key 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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-662-54388-7_8 | PKC |
Field | DocType | Volume |
Homomorphic encryption,Discrete mathematics,Computer science,Random oracle,Theoretical computer science,Encryption,Ciphertext,Obfuscation | Conference | 10175 |
ISSN | Citations | PageRank |
0302-9743 | 11 | 0.50 |
References | Authors | |
19 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ran Canetti | 1 | 11355 | 764.53 |
| Srinivasan Raghuraman | 2 | 30 | 3.14 |
| Silas Richelson | 3 | 83 | 6.63 |
| Vinod Vaikuntanathan | 4 | 5353 | 200.79 |