首页 | 官方网站   微博 | 高级检索  
     

优化的基于错误学习问题的CKKS方案
引用本文:郑尚文,刘尧,周潭平,杨晓元.优化的基于错误学习问题的CKKS方案[J].计算机应用,2021,41(6):1723-1728.
作者姓名:郑尚文  刘尧  周潭平  杨晓元
作者单位:1. 武警工程大学 密码工程学院, 西安 710086;2. 中国科学院 软件研究所, 北京 100090;3. 网络和信息安全武警部队重点实验室(武警工程大学), 西安 710086
基金项目:国家重点研发计划项目(2017YFB0802000);国家自然科学基金资助项目(U1636114,61872384);陕西省自然科学基金资助项目(2020JQ-492);武警工程大学科研创新团队项目(KYTD201805);武警工程大学基础基金资助项目(WJY201910,WJY201914,WJY201912)。
摘    要:针对基于错误学习(LWE)问题的CKKS同态加密方案在密态数据计算中存在的密文大、计算密钥生成复杂以及同态计算效率低的缺陷,运用比特丢弃和同态计算密钥重组的方法,提出了一种优化的LWE型CKKS方案。首先,丢弃密文向量的部分低位比特和同态乘法计算中密文张量积的部分低位比特,从而减小了同态乘法过程中的密文规模;其次,针对比特丢弃对同态计算密钥进行重组和优化,从而去除密钥交换过程中powersof2含有的无关扩展项并降低计算密钥的规模和同态乘法过程中的噪声增长规模。在保证原有方案安全性的基础上,所提优化方案使得计算密钥的维度减少,使得同态乘法的计算复杂性降低。分析结果表明,所提出的优化方案在一定程度上降低了同态计算及计算密钥生成过程的计算复杂性,从而降低了存储开销并提升了同态乘法运算的效率。

关 键 词:同态加密  错误学习问题  低位比特丢弃  计算密钥  计算复杂性  
收稿时间:2020-09-17
修稿时间:2020-11-30

Optimized CKKS scheme based on learning with errors problem
ZHENG Shangwen,LIU Yao,ZHOU Tanping,YANG Xiaoyuan.Optimized CKKS scheme based on learning with errors problem[J].journal of Computer Applications,2021,41(6):1723-1728.
Authors:ZHENG Shangwen  LIU Yao  ZHOU Tanping  YANG Xiaoyuan
Affiliation:1. College of Cryptographic Engineering, Engineering University of PAP, Xi'an Shaanxi 710086, China;2. Institute of Software, Chinese Academy of Sciences, Beijing 100090, China;3. Key Laboratory of Network and Information Security of PAP;(Engineering University of PAP), Xi'an Shaanxi 710086, China
Abstract:Focused on the issue that the CKKS (Cheon-Kim-Kim-Song) homomorphic encryption scheme based on the Learning With Errors (LWE) problem has large ciphertext, complicated calculation key generation and low homomorphic calculation efficiency in the encrypted data calculation, an optimized scheme of LWE type CKKS was proposed through the method of bit discarding and homomorphic calculation key reorganization. Firstly, the size of the ciphertext in the homomorphic multiplication process was reduced by discarding part of the low-order bits of the ciphertext vector and part of the low-order bits of the ciphertext tensor product in the homomorphic multiplication. Secondly, the method of bit discarding was used to reorganize and optimize the homomorphic calculation key, so as to remove the irrelevant extension items in powersof2 during the key exchange procedure and reduce the scale of the calculation key as well as the noise increase in the process of homomorphic multiplication. On the basis of ensuring the security of the original scheme, the proposed optimized scheme makes the dimension of the calculation key reduced, and the computational complexity of the homomorphic multiplication reduced. The analysis results show that the proposed optimized scheme reduces the computational complexity of the homomorphic calculation and calculation key generation process to a certain extent, so as to reduce the storage overhead and improve the efficiency of the homomorphic multiplication operation.
Keywords:homomorphic encryption  Learning With Errors (LWE) problem  low-order bits discarding  calculation key  computational complexity  
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号