Name
Abstract | ||
|---|---|---|
AbstractFully homomorphic encryption FHE has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations are inefficient. In this paper, the 'special b' variant of the learning with errors problem bLWE is presented, and helps us construct the first circularly secure key switching process which can replace the key switching process and similar re-linearisation process used by the existing FHE schemes. Then, we present an efficient FHE. Compared with Brakerski's scheme, our scheme reduces L secret keys to one and is more efficient. Finally, we prove the chosen-plaintext attack CPA security of the fully homomorphic scheme and the circular security of key switching process in standard model under the learning with errors problem LWE assumption. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1504/IJHPCN.2016.080414 | Periodicals |
DocType | Volume | Issue |
Journal | 9 | 5/6 |
ISSN | Citations | PageRank |
1740-0562 | 1 | 0.35 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tanping Zhou | 1 | 1 | 0.35 |
| Xiaoyuan Yang | 2 | 440 | 66.08 |
| Wei Zhang | 3 | 287 | 35.43 |
| Liqiang Wu | 4 | 1 | 0.35 |