A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM Schemes
Citations Over TimeTop 10% of 2018 papers
Abstract
Achieving both simplicity and efficiency in fully homomorphic encryption (FHE) schemes is important for practical applications. In the simple FHE scheme proposed by Ducas and Micciancio (DM), ciphertexts are refreshed after each homomorphic operation. And ciphertext refreshing has become a major bottleneck for the overall efficiency of the scheme. In this paper, we propose a more efficient FHE scheme with fewer ciphertext refreshings. Based on the DM scheme and another simple FHE scheme proposed by Gentry, Sahai, and Waters (GSW), ciphertext matrix operations and ciphertext vector additions are both applied in our scheme. Compared with the DM scheme, one more homomorphic NOT AND (NAND) operation can be performed on ciphertexts before ciphertext refreshing. Results show that, under the same security parameters, the computational cost of our scheme is obviously lower than that of GSW and DM schemes for a depth-2 binary circuit with NAND gates. And the error rate of our scheme is kept at a sufficiently low level.
Related Papers
- → Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security(2012)50 cited
- → Optimized relinearization algorithm of the multikey homomorphic encryption scheme(2021)10 cited
- → Mis-operation Resistant Searchable Homomorphic Encryption(2017)5 cited
- Compactly-Optimized DGHV Fully-Homomorphic Encryption Scheme(2013)
- Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security.(2012)