RLWE-Based Homomorphic Encryption and Private Information Retrieval

Author

Wei Zhang ; Shuguang Liu ; Yang Xiaoyuan

Author_Institution

Key Lab. of Comput. Network & Inf. Security, CAPF, Xian, China

fYear

2013

fDate

9-11 Sept. 2013

Firstpage

535

Lastpage

540

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.

Keywords

computational complexity; cryptography; data privacy; information retrieval; polynomials; CPA security; O(nlog n) scalar operations; RLWE assumption; RLWE-based homomorphic encryption; canonical embedding; cipher text size; learning-with-errors-over-rings assumption; multi-bit somewhat homomorphic encryption scheme; polynomial multiplication operation; private information retrieval protocol; Encryption; Information retrieval; Polynomials; Protocols; Public key; Vectors; RLWE assumption; canonical embedding; homomorphic encryption; private information retrieval;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Networking and Collaborative Systems (INCoS), 2013 5th International Conference on

Conference_Location

Xi´an

Type

conf

DOI

10.1109/INCoS.2013.100

Filename

6630470