International Conference on Intelligent Networking and Collaborative Systems (INCoS)

RLWE-Based Homomorphic Encryption and Private Information Retrieval

Wei Zhang, Shuguang Liu, Xiaoyuan Yang

Published Sep 1, 2013• 7 citations

Abstract

A multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings (RLWE) assumption is provided, which use canonical embedding to transform elements over a ring into vectors, thus the operation of polynomial multiplication can be performed within O(nlog n) scalar operations, and cipher text size is reduced as well. CPA security of this scheme can be reduced into RLWE assumption. Moreover, an efficient private information retrieval protocol that employs this scheme is presented.

DOI: 10.1109/incos.2013.100

Related papers

How to build a faster private information retrieval protocol?

Wei Zhang, Shuguang Liu, Weidong Zhong +1 more

A CPA secure multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings assumption is presented. We use canonical embedding to transform ring elements into vectors over Z q , and thus decrease encryption and decryption cost. Comparing with GHV scheme appeared in 2010, to encrypt n bits, this scheme can reduce encryption cost from O(n 3/2) into O(nlog n). Finally, an efficient private information retrieval protocol that employs this scheme is presented.

Journal of Ambient Intelligence and Humanized ComputingJun 4, 20143 citations

Towards an efficient LWE‐based fully homomorphic encryption scheme

Uddipana Dowerah, Srinivasan Krishnaswamy

Abstract The security of most early fully homomorphic encryption schemes was based on the hardness of the Learning with Errors (LWE) problem. These schemes were inefficient in terms of per gate computations and public‐key size. More efficient schemes were later developed based on the hardness of the Ring‐LWE (RLWE) problem. While the hardness of the LWE problem is based on the hardness of the approximate shortest vector problem (GapSVP γ ) over regular lattices, the hardness of the RLWE problem is based on the hardness of the approximate shortest vector problem over ideal lattices. As of now, it has not been proved that the (GapSVP γ ) problem over ideal lattices is as difficult as the corresponding problem over regular lattices. In this work, the authors propose a multi‐bit levelled fully homomorphic encryption scheme using multivariate polynomial evaluations whose security depends on the hardness of the LWE problem. In terms of per gate computation cost, this scheme is more efficient than existing LWE‐based schemes. Further, for an appropriate choice of parameters, the per computation cost for homomorphic multiplication can be made asymptotically comparable to RLWE‐based schemes in a parallel computing environment. For homomorphic multiplication, the scheme uses a polynomial‐based technique that does not require relinearization (and key switching).

IET Information SecurityApr 28, 202215 citations

One Improved RLWE-based FHE and Fast Private Information Retrieval

Weitao Song, Bin Hu and Xiu-Feng Zhao

With the rapid development of cloud computing, it raises real questions on privacy protection, which greatly limits the use of cloud computing.However, fully homomorphic encryption (FHE) can make cloud computing consistent with privacy.In this paper, we propose a simpler FHE scheme based on ring LWE problem, with a smaller size of ciphertext and a lower noise-expansion factor for homomorphic multiplication.Then based on our optimized RLWE-based FHE scheme, we propose a fast single-database private information retrieval protocol, combining with batching and number theoretic transform technology.

KSII Transactions on Internet and Information SystemsDec 31, 20191 citation

Efficient Fully homomorphic encryption scheme using Ring-LWE

Dan Xin, Jingzhou Ji, Jing Feng +2 more

Abstract Data can be stored and processed in an encrypted format using fully homomorphic encryption, which makes cloud computing provider can process data well without even knowing data information. However, most existing homomorphic encryption schemes based on ring learning with errors, focus on the special classes of rings, such as power-of-two cyclotomic rings, which significantly limits its application efficiency in cloud computing. Therefore, in this letter, to solve this problem above, an efficient fully homomorphic encryption scheme is proposed based on ring learning with errors in arbitrary cyclotomic rings. Particularly, a “somewhat homomorphic encryption” scheme is firstly proposed based on ring learning with errors. A novel fully homomorphic encryption scheme is further presented using key-switching. With theoretical and experimental verification, the proposed scheme has advantage of high efficiency of encryption and decryption. The security of our scheme strictly reduces to hardness of decision ring learning with errors problem in the random oracle model.

Journal of Physics Conference SeriesJan 1, 20214 citations

Maliciously circuit-private multi-key FHE and MPC based on LWE

Nuttapong Attrapadung, Goichiro Hanaoka, Ryo Hiromasa +2 more

Abstract In this paper, we construct multi-key homomorphic and fully homomorphic encryption (resp. MKHE and MKFHE) schemes with malicious circuit privacy. Our schemes are based on learning with errors (LWE) besides appropriate circular security assumptions. In contrast, the previous maliciously circuit-private MKFHE scheme by Chongchitmate and Ostrovsky (PKC, 2017) is based on the non-standard decisional small polynomial ratio (DSPR) assumption with a super-polynomial modulus, besides ring learning with errors and circular security assumptions. We note that it was shown by Albrecht et al. (CRYPTO, 2016) that there exists a sub-exponential time attack against this type of DSPR assumption. The main building block of our maliciously circuit-private MKFHE scheme is a (plain) MKFHE scheme by Brakerski et al. (TCC, 2017), and the security of our schemes is proven under the hardness of LWE with sub-exponential modulus-to-noise ratio and circular security assumptions related to the Brakerski et al. scheme. Furthermore, based on our MKFHE schemes, we construct four-round multi-party computation (MPC) protocols with circuit privacy against a semi-honest server and malicious clients in the plain model. The protocols are obtained by combining our schemes with a maliciously sender-private oblivious transfer protocol and a circuit garbling scheme, all of which can be instantiated only assuming LWE.

Designs Codes and CryptographyDec 30, 20223 citations

Multi-key Fully Homomorphic Encryption without CRS from RLWE

Fucai Luo, Haiyan Wang, Saif M. Al-Kuwari +1 more

Fully Homomorphic Encryption (FHE) is a powerful encryption system in cloud computing that allows homomorphic computations on encrypted data without decrypting them. Multi-key fully homomorphic encryption (MFHE), as an extension to FHE, allows homomorphic computations on ciphertexts encrypted under different keys. However, most MFHE schemes require a Common Random/Reference String (CRS), while the few that do not are based on the Learning With Errors (LWE) problem, which means that they can only deal with single bit plaintext. Consequently, MFHE schemes based on the Ring Learning With Errors (RLWE) problem are more desirable, as they can handle polynomial plaintext. Requiring the CRS seems to weaken the semantic definition of MFHE, where all users generate their own keys independently. In this paper, we study the RLWE-based MFHE in the CRS model and propose the first RLWE-based MFHE without a CRS. To this end, we remove the CRS by designing a relinearization algorithm without a CRS. Like previous MFHE schemes, our RLWE-based MFHE without CRS has a simple 1-round threshold decryption, which implies a 3-round secure MPC protocol in the plain model from the RLWE assumption.

Computer Standards & InterfacesMar 24, 20239 citations