Difference between revisions of "FHE over the Integers"
Jump to navigation
Jump to search
(Created page with "This is a fully homomorphic encryption relying only on modular arithmetic. The authors first create an somewhat homomorphic scheme which is bootstrappable and then app...") |
|||
| Line 1: | Line 1: | ||
This is a fully homomorphic encryption relying only on modular arithmetic. The authors first create an [[somewhat homomorphic scheme]] which is [[bootstrappable]] and then apply Gentry's technique to construct a fully homomorphic scheme. | This is a fully homomorphic encryption relying only on modular arithmetic. The authors first create an [[somewhat homomorphic scheme]] which is [[bootstrappable]] and then apply Gentry's technique to construct a fully homomorphic scheme. | ||
| + | |||
| + | One of the main advantages of this scheme consists of its conceptual simplicity. | ||
Revision as of 15:11, 24 March 2020
This is a fully homomorphic encryption relying only on modular arithmetic. The authors first create an somewhat homomorphic scheme which is bootstrappable and then apply Gentry's technique to construct a fully homomorphic scheme.
One of the main advantages of this scheme consists of its conceptual simplicity.
