成玉丹,
刘超,
赵冰,
许钦百
西北师范大学计算机科学与工程学院 ??兰州 ??730070
基金项目:国家自然科学基金(61202395, 61562077, 61662069, 61662071)；甘肃省自然科学基金(145RJDA325)
详细信息
作者简介:王彩芬：女，1963 年生，教授，博士生导师，研究方向为密码学与信息安全
成玉丹：女，1992 年生，硕士生，研究方向为密码学与信息安全
刘超：男，1989 年生，硕士生，研究方向为密码学与信息安全
赵冰：男，1994 年生，硕士生，研究方向为密码学与信息安全
许钦百：男，1992 年生，硕士生，研究方向为密码学与信息安全
通讯作者:王彩芬 wangcf@nwnu.edu.cn
中图分类号:TP309计量
文章访问数:1476
HTML全文浏览量:483
PDF下载量:39
被引次数:0
出版历程
收稿日期:2017-12-19
修回日期:2018-05-02
网络出版日期:2018-07-12
刊出日期:2018-09-01
Multiple to One Fully Homomorphic Encryption Scheme over the Integers
Caifen WANG,,Yudan CHENG,
Chao LIU,
Bing ZHAO,
Qinbai XU
College of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China
Funds:The National Natural Science Foundation of China (61202395, 61562077, 61662069, 61662071); The Natural Science Foundation of Gansu Province (145RJDA325)
摘要
摘要:全同态加密是在不解密密文的情况下直接对密文进行操作。现有的基于整数的全同态加密方案是针对两个参与者“一方加密，一方解密”(一对一)设计的，计算效率普遍低，明文空间小，不能应用于大数据、云计算等环境。为此，该文提出一种“多方加密，一方解密”(多对一)的全同态加密方案，该方案在保证安全性的基础上简化密钥生成过程，并在全同态运算过程中给出能够正确解密的加密方个数的具体范围。同时，在随机预言机模型下，基于近似最大公因子问题证明了方案的安全性。数值结果表明，该方案与已有方案相比不仅扩展了数据传输量，而且提高了效率。模拟实验表明，该方案在整数范围内具有可行性，满足用户对系统响应的需求，最后将明文空间扩展为3 bit，并与1 bit的方案做出了实验上的对比分析。
关键词:全同态加密/
多对一/
近似最大公因子问题/
数据扩展
Abstract:Fully homomorphic encryption allows any operation evaluation on encrypted data without decryption. The existing integer-based homomorphic encryption schemes are designed only for two participants namely one party encryption one party decryption (one-to-one), whose computational efficiency is generally low, plaintext space is small, so it can not be applied to big data, cloud computing and other actual scene. Therefore, a full homomorphic encryption scheme with multi-party encryption, one party decryption (multiple to one) is presented. The scheme simplifies the key generation process on the basis of guaranteeing the security, but also gives the range of the number of encrypted parties that can be decrypted accurately in the process of homomorphic operation. Meanwhile, in the random oracle model, the security of the new scheme is proved based on approximate Greatest Common Divisor (GCD) problem. Numerical analysis demonstrates that the presented scheme can not only extend the data traffic, but also improve the efficiency by comparing with the existing schemes. Simulation results show that proposed scheme is more practical in the range of integer, and meets the requirements of the users to the system response. Finally, the plaintext space is expanded to 3 bit, comparing and analysing the experiment with the scheme of 1 bit.
Key words:Fully homomorphic encryption/
Multiple to one/
Greatest Common Divisor (GCD) problem/
Data expansion
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=2fa92da3-9b76-4614-a551-2e9f70d9b906
