Difference between revisions of "BGV"
Jump to navigation
Jump to search
(Created page with "A fully homomorphic encryption (FHE) that improves performance and bases security on weaker assumptions than schemes from the previous generation. A central conceptual contrib...") |
|||
Line 1: | Line 1: | ||
− | A fully homomorphic encryption (FHE) that improves performance and bases security on weaker assumptions than schemes from the previous generation. A central conceptual contribution of this | + | A fully homomorphic encryption (FHE) that improves performance and bases security on weaker assumptions than schemes from the previous generation. |
+ | |||
+ | A central conceptual contribution of this | ||
work is a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating | work is a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating | ||
arbitrary polynomial-size circuits), without Gentry’s bootstrapping procedure. | arbitrary polynomial-size circuits), without Gentry’s bootstrapping procedure. | ||
+ | |||
+ | Until recently, the BGV scheme was considered to be the most efficient homomorphic encryption scheme when performing the same operations on multiple ciphertexts at once. | ||
+ | |||
+ | == Modulus switching == | ||
+ | |||
+ | @TODO | ||
+ | |||
+ | == New noise management technique == | ||
+ | |||
+ | @TODO |
Revision as of 13:33, 5 January 2021
A fully homomorphic encryption (FHE) that improves performance and bases security on weaker assumptions than schemes from the previous generation.
A central conceptual contribution of this work is a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), without Gentry’s bootstrapping procedure.
Until recently, the BGV scheme was considered to be the most efficient homomorphic encryption scheme when performing the same operations on multiple ciphertexts at once.
Modulus switching
@TODO
New noise management technique
@TODO