Flattening NTRU for Evaluation Key Free Homomorphic Encryption
| Autor: | Berk Sunar, Yarkin Doröz |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Scheme (programming language)
Polynomial NTRU Computer science Applied Mathematics homomorphic encryption Homomorphic encryption Binary number subfield lattice attack Computer Science Applications flattening 03g10 Computational Mathematics Noise 81p94 Integer ntru QA1-939 Multiplication dspr 94a60 computer Algorithm Mathematics computer.programming_language |
| Zdroj: | Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 66-83 (2020) |
| ISSN: | 1862-2984 1862-2976 |
| DOI: | 10.1515/jmc-2015-0052 |
| Popis: | We propose a new FHE scheme F-NTRU that adopts the flattening technique proposed in GSW to derive an NTRU based scheme that (similar to GSW) does not require evaluation keys or key switching. Our scheme eliminates the decision small polynomial ratio (DSPR) assumption but relies only on the standard R-LWE assumption. It uses wide key distributions, and hence is immune to the Subfield Lattice Attack. In practice, our scheme achieves competitive timings compared to the existing schemes. We are able to compute a homomorphic multiplication in 5.8 msec and 17.6 msec for 5 and 30 levels, respectively, without amortization. Furthermore, our scheme features small ciphertexts, e.g. 567 KB for 30 levels, and eliminates the need for storing and managing costly evaluation keys. In addition, we present a slightly modified version of F-NTRU that is capable to support integer operations with a very large message space along with noise analysis for all cases. The assurance gained by using wide key distributions along with the message space flexibility of the scheme, i.e. bits, binary polynomials, and integers with a large message space, allows the use the proposed scheme in a wide array of applications. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|