Welcome to the resource topic for 2016/488
Title:
Efficient Homomorphic Integer Polynomial Evaluation based on GSW FHE
Authors: Husen Wang, Qiang Tang
Abstract:We introduce new methods to evaluate integer polynomials with GSW FHE, which has much slower noise growth and per integer multiplication cost O((\log k/k)^{4.7454}/n) times the original GSW, where k is the input plaintext width, n is the LWE dimention parameter. Basically we reduce the integer multiplication noise by performing the evaluation between two kinds of ciphertexts, one in \mathbb{Z}_q and another in \mathbb{F}_2^{\lceil \log q \rceil}. The conversion between two ciphertexts can be achieved by the integer bootstrapping. We also propose to solve the ciphertext expansion problem by symmetric encryption with stream ciphers.
ePrint: https://eprint.iacr.org/2016/488
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .