基于Somewhat同态加密方案的一种证明
A Proof Based on the Somewhat Homomorphic Encryption Scheme
DOI: 10.12677/SEA.2013.22008, PDF, HTML, 下载: 3,078  浏览: 10,390  科研立项经费支持
作者: 杨 竞, 范明钰, 王光卫：电子科技大学计算机学院，成都；孔志印：信息保障技术重点实验室，北京
关键词: Somewhat同态加密；同态性；解密； Somewhat Homomorphic Encryption; Homomorphism; Decryption
摘要:

在Gentry的同态加密理论中，Somewhat同态加密是Gentry框架中的全同态加密方案的基础。由于目前的研究多数是基于Somewhat同态加密方案的拓展而少有对Somewhat同态加密方案的证明，本文给出基于Somewhat同态加密方案的一种证明。

Abstract: In the Gentry’s Homomorphic encryption scheme, Somewhat homomorphic encryption is the base of Gentry’s homomorphic encryption. For the present study is based on the most Somewhat homomorphism encryption scheme to develop without Somewhat homomorphism encryption scheme proof, this paper gives a proof based on Somewhat homomorphism encryption scheme.

文章引用：杨竞, 范明钰, 王光卫, 孔志印. 基于Somewhat同态加密方案的一种证明[J]. 软件工程与应用, 2013, 2(2): 43-46. http://dx.doi.org/10.12677/SEA.2013.22008

参考文献

[1] 冯登国, 张敏, 张妍等. 云计算安全研究[J]. 软件学报, 2011, 22(1): 71-83.
[2] R. L. Rivest, L. Adleman and M. L. Deaouzos. On data banks and privacy homomorphism. In R. A. DeMillo, Ed., Foundations of secure computation. New York: Academic Press, 1978: 169- 179.
[3] J. Domingo-Ferrer. A provably secure additive and multiplicative privacy homomorphism. In Proceedings of the 5th International Conference on Information Security. Berlin: Springer- Verlag, 2002: 471-483.
[4] N. P. Smart. 密码术与编码[M]. 武汉: 湖北辞书出版社, 2008: 126-128.
[5] C. Gentry. A fully homomorphic encryption scheme. Stanford: Stanford University, 2009.
[6] G. Gentry, S. Halevi. Implementing Gentry’s fully homomorphic encryption scheme. Advances in Cryptology-EUROCRYPT 2011 Lecture Notes in Computer Science, 2011, 6632: 129-148.
[7] 徐鹏, 刘超, 斯雪明. 基于整数多项式环的全同态加密算法[J]. 计算机工程, 2012, 24: 1-4.

为你推荐