Stanford University

A fully homomorphic encryption scheme

作者:
C. Gentry.

关键词:
Computer science A fully homomorphic encryption scheme STA...Craig

摘要:
We propose the first fully homomorphic encryption scheme, solving an old open problem. Such a scheme allows one to compute arbitrary functions over encrypted data without the decryption key—i.e., given encryptions (), ..., () of , ..., one can efficiently compute a compact ciphertext that encrypts (, ..., ) for any efficiently computable function .

在线下载

相关文章:
在线客服:
对外合作:
联系方式:400-6379-560
投诉建议:feedback@hanspub.org
客服号

人工客服,优惠资讯,稿件咨询
公众号

科技前沿与学术知识分享