|
基于整数多项式环的全同态加密算法
Fully Homomorphic Encryption Algorithm Based on Integer Polynomial Ring
查看参考文献16篇
文摘
|
为确保云计算环境下用户数据的安全性,利用同态加密算法对数据和加密函数的隐私保护功能,设计一种基于整数多项式环的全同态加密算法。该算法包括同态算法和重加密算法,前者针对明文数据进行加密,后者针对密文数据进行二次加密。分析结果表明,该算法的计算复杂度为O(n~5),低于理想格全同态加密算法。 |
其他语种文摘
|
To ensure the user data security under cloud computing environment, this paper uses homomorphism encryption algorithm for data and encryption function of privacy protection function, and designs a new fully homomorphic encryption algorithm based on integral polynomial ring. Both the homomorphic encryption and the re-encryption are included in the algorithm. The homomorphic encryption is used to encrypt the data, and re-encryption is used to encrypt the encrypted data. Analysis result shows that the proposed algorithm computing complexity O(n~5) is lower than ideal lattice fully homomorphic encryption. |
来源
|
计算机工程
,2012,38(24):1-4 【核心库】
|
关键词
|
全同态加密算法
;
云计算安全
;
数据加密
;
理想格
;
近似最大公约数
;
隐私保护
|
地址
|
信息工程大学信息工程学院, 郑州, 450002
|
语种
|
中文 |
ISSN
|
1000-3428 |
学科
|
自动化技术、计算机技术 |
基金
|
国家863计划
|
文献收藏号
|
CSCD:4726334
|
参考文献 共
16
共1页
|
1.
Rivest R.
On Data Banks and Privacy Homomorphisms,1978:169-177
|
CSCD被引
3
次
|
|
|
|
2.
Lipton B. Searching for Elements in Black Box Fields and Applications.
Proc. of Cryptology-Crypto'96,1996:283-297
|
CSCD被引
1
次
|
|
|
|
3.
Domingo-Ferrer J. A Provably Secure Additive and Multiplicative Privacy Homomorphism.
Proc. of the 5th International Conference on Information Security,2002:471-483
|
CSCD被引
1
次
|
|
|
|
4.
Brickell E F. On Privacy Homomorphisms.
Proc. of Cryptology-EuroCrypt'87,1987:117-126
|
CSCD被引
1
次
|
|
|
|
5.
Feigenbaum J.
Open Question, Talk Abstracts, and Summary of Discussions,1991
|
CSCD被引
1
次
|
|
|
|
6.
Fellows M.
Combinatorial Cryptosystems Galore!,1993
|
CSCD被引
1
次
|
|
|
|
7.
Gentry C. Fully Homomorphic Encryption Using Ideal Lattice.
Proc. of STOC'09,2009:169-178
|
CSCD被引
1
次
|
|
|
|
8.
van Dijk M. Fully Homomorphic Encryption over the Integers.
Proc. of Cryptology-CRYPTO'11,2011:24-43
|
CSCD被引
1
次
|
|
|
|
9.
Gentry C. Fully Homomorphic Encryption Without Squashing Using Depth-3 Arithmetic Circuits.
Proc. of FOCSIEEE'11,2011
|
CSCD被引
1
次
|
|
|
|
10.
Melchor C A. Lattice-based Homomorphic Encryption of Vector Spaces.
Proc. of ISIT'08,2008:1858-1862
|
CSCD被引
1
次
|
|
|
|
11.
Coron J S. Fully Homomorphic Encryption over the Integers with Shorter Public-keys.
Proc. of the 31st Annual Conference on Advances in Cryptology,2011
|
CSCD被引
1
次
|
|
|
|
12.
Chen Y. Faster Algorithms for Approximate Common Divisors: Breaking Fully-homomorphic-encryption Challenges over the Integers.
Proc. of Cryptology-EUROCRYPT'12,2012
|
CSCD被引
1
次
|
|
|
|
13.
Chung K M. Improved Delegation of omputation Using Fully Homomorphic Encryption.
Proc. of the 30th Annual Conference on Advances in Cryptology,2010
|
CSCD被引
1
次
|
|
|
|
14.
Silvano M.
Knapsack Problems: Algorithms and Computer Interpretations,1990
|
CSCD被引
1
次
|
|
|
|
15.
Pfitzmann B. Attacks on Protocols for Server-aided SA Computation.
Proc. of EUROCRYPT'92,1992
|
CSCD被引
1
次
|
|
|
|
16.
Nguyen P Q. On the Insecurity of a Server-aided RSA Protocol.
Proc. of ASIACRYPT'01,2001:21-35
|
CSCD被引
1
次
|
|
|
|
|
|