Computing Arbitrary Functions of Encrypted Data

被引:346
作者
Gentry, Craig [1 ]
机构
[1] IBM Corp, IJ Watson Res Ctr, Hawthorne, NY USA
关键词
D O I
10.1145/1666420.1666444
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorphic" encryption scheme that keeps data private, but that allows a worker that does not have the secret decryption key to compute any (still encrypted) result of the data, even when the function of the data is very complex. In short, a third party can perform complicated processing of data without being able to see it. Among other things, this helps make cloud computing compatible with privacy.
引用
收藏
页码:97 / 105
页数:9
相关论文
共 9 条
[1]  
BONEH D, 1996, CRYPTO 96, P283
[2]  
Gentry C., 2009, FULLY HOMOMORPHIC EN, V20
[3]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178
[4]   PROBABILISTIC ENCRYPTION [J].
GOLDWASSER, S ;
MICALI, S .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) :270-299
[5]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017
[6]  
Rivest Ronald L, 1978, On data banks and privacy homomorphisms, V4, P169, DOI DOI 10.4067/S0716-078X2003000400011
[7]  
Smart n.P., 2009, FULLY HOMOMORPHIC EN
[8]   Quantum algorithms for some hidden shift problems [J].
van Dam, Wim ;
Hallgren, Sean ;
Ip, Lawrence .
SIAM JOURNAL ON COMPUTING, 2006, 36 (03) :763-778
[9]  
van Dijk M., 2009, Fully Homomorphic Encryption over the Integers