Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem

XIN Dan; GU Chun-xiang; ZHENG Yong-hui; GUANG Yan; KANG Yuan-ji

doi:10.3969/j.issn.0372-2112.2016.12.011

您当前的位置：

首页 >

文章列表页 >

Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem

更新时间：2025-07-16

- Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem
- Acta Electronica Sinica Vol. 44, Issue 12, Pages: 2887-2893(2016)
- 作者机构：
  
  1. 信息工程大学,河南,郑州,450002
  2. 数学工程与先进计算国家重点实验室,江苏,无锡,214125
  3. 信息工程大学,河南,郑州,450002
  4. 数学工程与先进计算国家重点实验室,江苏,无锡,214125
- 作者简介：
- 基金信息：
  
  Science and Technology Innovation Outstanding Youth Fund of Henan Province (No.134100510002);Henan Research Program of Basic and Frontier Technology (No.142300410002);supported by Open Fund of State Key Laboratory of Mathematical Engineering and Advanced Computing
- DOI：10.3969/j.issn.0372-2112.2016.12.011
  CLC： TN918.1
- Published Online：25 December 2016，
  
  Published：2016
- 稿件说明：
移动端阅览
XIN Dan, GU Chun-xiang, ZHENG Yong-hui, et al. Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem[J]. Acta Electronica Sinica, 2016, 44(12): 2887-2893.
DOI：

XIN Dan, GU Chun-xiang, ZHENG Yong-hui, et al. Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem[J]. Acta Electronica Sinica, 2016, 44(12): 2887-2893. DOI： 10.3969/j.issn.0372-2112.2016.12.011.

摘要

全同态加密为云计算中数据全生命周期隐私保护等难题的解决都提供了新的思路.公钥尺寸较大是现有全同态加密体制普遍存在的问题.本文将基于身份加密的思想和全同态加密体制相结合，利用环上容错学习问题（Ring Learning With Errors，RLWE），其中将环的参数

扩展到任意正整数，提出了一种基于身份的全同态加密体制.体制以用户身份标识作为公钥，在计算效率和密钥管理方面都具有优势，安全性在随机喻示模型下可规约为判定性RLWE问题难解性假设.

Abstract

Fully homomorphic encryption provides a new idea on the solution of many problems

such as the whole life cycle of data privacy protection on cloud computing.Currently

the existing fully homomorphic encryption schemes share a common flaw of large size public keys.We construct an identity-based fully homomorphic encryption which compromises the merits of both kinds of encryption from ring learning with errors to work in arbitrary cyclotomic rings.To make user's identity as the unique public key

our scheme has advantage in computational efficiency and key management.The security of our scheme strictly reduces to hardness of decision ring learning with problem solving in the random oracle model.

关键词

Keywords

references

Views

882

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Low-Cost Twiddle Tactor Generator for Fully Homomorphic Encryption

An Identity-Based Fully Homomorphic Encryption Over NTRU Lattice

A Fully Homomorphic Encryption Scheme Based on NTRU

Rational Delegation Computation Protocol Based on Fully Homomorphic Encryption

Related Author

NAN Long-mei

DU Yi-ran

CHEN Tao

BIE Meng-ni

LI Wei

FU Qiu-xing

CHEN Li

ZHENG Yong-hui

Related Institution

University of Information Engineering

Fourth Department, PLA Information Engineering University

Institute of Network Information Security, Henan University of Economics and Law

Fourth Department PLA Information Engineering University Zhengzhou Henan China

Institute of Network Information Security Henan University of Economics and Law Zhengzhou Henan China

⁰