Fully homomorphic encryption based on the ring learning with rounding problem

被引：5

作者：

Luo, Fucai ^{[1
,2
,3
]}

Wang, Fuqun ^{[4
,5
]}

Wang, Kunpeng ^{[2
,3
]}

Chen, Kefei ^{[4
,5
]}

机构：

[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing, Jiangsu, Peoples R China

[2] Univ Chinese Acad Sci, Sch Cyber Secur, Beijing, Peoples R China

[3] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing, Peoples R China

[4] Hangzhou Normal Univ, Dept Math, Hangzhou, Zhejiang, Peoples R China

[5] Westone Cryptol Res Ctr, Beijing, Peoples R China

来源：

IET INFORMATION SECURITY | 2019年 / 13卷 / 06期

关键词：

public key cryptography; deterministic variant; LWR instance; homomorphic operations; RLWR-based FHE scheme; RLWR assumption; fully homomorphic encryption schemes; ring learning with rounding problem; RLWR problem; learning with errors; relinearisation method; IND-CPA;

D O I：

10.1049/iet-ifs.2018.5427

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Almost all existing well-known fully homomorphic encryption (FHE) schemes, which are based on either the learning with errors (LWE) or the ring LWE problem, require expensive Gaussian noise sampling. In this study, the authors propose an FHE scheme based on the ring learning with rounding (RLWR) problem. The learning with rounding (LWR) problem was proposed as a deterministic variant of LWE, while the RLWR is a variant of LWR. Sampling an LWR instance does not require Gaussian noise sampling process, and neither does an RLWR instance. Thus, our FHE scheme can be instantiated without the need for Gaussian noise sampling. To implement homomorphic operations, we devise a specific relinearisation method. Furthermore, we also prove that our RLWR-based FHE scheme is IND-CPA secure under RLWR assumption.

引用

页码：639 / 648

页数：10