Efficient Homomorphic Integer Polynomial Evaluation based on GSW FHE
نویسندگان
چکیده
In this paper, we introduce new methods to evaluate integer polynomials with GSW FHE. Our solution has much slower noise growth and per homomorphic integer multiplication cost, which is only O( (log k) w+1 kw·n ) percent of the original GSW scheme, where k is the input plaintext width, n is the LWE dimention, and ω = 2.373. Technically, we reduce the integer multiplication noise by performing the evaluation between two kinds of ciphertexts, one in Zq and the other in F qe 2 . To achieve generality, we propose an integer bootstrapping scheme which converts these two kinds of ciphertexts into each other. To solve the ciphertext expansion problem due to ciphertexts in F qe 2 , we propose a solution based on symmetric encryption with stream ciphers.
منابع مشابه
Methods for Efficient Homomorphic Integer Polynomial Evaluation based on GSW FHE
We introduce new methods to evaluate integer polynomials with GSW FHE. Our methods cause much slower noise growth and result in much better efficiency in the evaluation of low-degree large plaintext space polynomials. One method is about a new encryption procedure and its application homomorphic integer multiplication. The other is about an extended version to SIMD by packing more integers diag...
متن کاملFlattening NTRU for Evaluation Key Free Homomorphic Encryption
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 Att...
متن کاملFHE Circuit Privacy Almost for Free
Circuit privacy is an important property for many applications of fully homomorphic encryption. Prior approaches for achieving circuit privacy rely on superpolynomial noise flooding or on bootstrapping. In this work, we present a conceptually different approach to circuit privacy based on a novel characterization of the noise growth amidst homomorphic evaluation. In particular, we show that a v...
متن کاملAn Approach to Reduce Storage for Homomorphic Computations
We introduce a hybrid homomorphic encryption by combining public key encryption (PKE) and somewhat homomorphic encryption (SHE) to reduce storage for most applications of somewhat or fully homomorphic encryption (FHE). In this model, one encrypts messages with a PKE and computes on encrypted data using a SHE or a FHE after homomorphic decryption. To obtain efficient homomorphic decryption, our ...
متن کاملFaster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
In this paper, we revisit fully homomorphic encryption (FHE) based on GSW and its ring variants. We notice that the internal product of GSW can be replaced by a simpler external product between a GSW and an LWE ciphertext. We show that the bootstrapping scheme FHEW of Ducas and Micciancio [14] can be expressed only in terms of this external product. As a result, we obtain a speed up from less t...
متن کامل