Name
Abstract | ||
|---|---|---|
We construct the first fully homomorphic encryption (FHE) scheme that encrypts matrices and supports homomorphic matrix addition and multiplication. This is a natural extension of packed FHE and thus supports more complicated homomorphic operations. We optimize the bootstrapping procedure of Alperin-Sheriff and Peikert (CRYPTO 2014) by applying our scheme. Our optimization decreases the lattice approximation factor from (O) over tilde (n(3)) to (O) over tilde (n(2.5)). By taking a lattice dimension as a larger polynomial in a security parameter, we can also obtain the same approximation factor as the best known one of standard lattice-based public-key encryption without successive dimension-modulus reduction, which was essential for achieving the best factor in prior works on bootstrapping of standard lattice-based FHE. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1587/transfun.E99.A.73 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
lattice-based cryptography, fully homomorphic encryption, bootstrapping, SIMD operations | Conference | E99A |
Issue | ISSN | Citations |
1 | 0916-8508 | 1 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryo Hiromasa | 1 | 1 | 0.68 |
| Masayuki Abe | 2 | 1335 | 68.58 |
| Tatsuaki Okamoto | 3 | 5408 | 521.96 |