LWR-Based Fully Homomorphic Encryption, Revisited
Joint Authors
Chen, Kefei
Li, Jie
Luo, Fucai
Wang, Fuqun
Wang, Kunpeng
Source
Security and Communication Networks
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-12, 12 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-04-23
Country of Publication
Egypt
No. of Pages
12
Main Subjects
Information Technology and Computer Science
Abstract EN
Very recently, Costache and Smart proposed a fully homomorphic encryption (FHE) scheme based on the Learning with Rounding (LWR) problem, which removes the noise (typically, Gaussian noise) sampling needed in the previous lattices-based FHEs.
But their scheme did not work, since the noise of homomorphic multiplication is complicated and large, which leads to failure of decryption.
More specifically, they chose LWR instances as a public key and the private key therein as a secret key and then used the tensor product to implement homomorphic multiplication, which resulted in a tangly modulus problem.
Recall that there are two moduli in the LWR instances, and then the moduli will tangle together due to the tensor product.
Inspired by their work, we built the first workable LWR-based FHE scheme eliminating the tangly modulus problem by cleverly adopting the celebrated approximate eigenvector method proposed by Gentry et al.
at Crypto 2013.
Roughly speaking, we use a specific matrix multiplication to perform the homomorphic multiplication, hence no tangly modulus problem.
Furthermore, we also extend the LWR-based FHE scheme to the multikey setting using the tricks used to construct LWE-based multikey FHE by Mukherjee and Wichs at Eurocrypt 2016.
Our LWR-based multikey FHE construction provides an alternative to the existing multikey FHEs and can also be applied to multiparty computation with higher efficiency.
American Psychological Association (APA)
Luo, Fucai& Wang, Fuqun& Wang, Kunpeng& Li, Jie& Chen, Kefei. 2018. LWR-Based Fully Homomorphic Encryption, Revisited. Security and Communication Networks،Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1214251
Modern Language Association (MLA)
Luo, Fucai…[et al.]. LWR-Based Fully Homomorphic Encryption, Revisited. Security and Communication Networks No. 2018 (2018), pp.1-12.
https://search.emarefa.net/detail/BIM-1214251
American Medical Association (AMA)
Luo, Fucai& Wang, Fuqun& Wang, Kunpeng& Li, Jie& Chen, Kefei. LWR-Based Fully Homomorphic Encryption, Revisited. Security and Communication Networks. 2018. Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1214251
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1214251