参考文献
[1] Rivest R, Adleman L, Dertouzos M. On Data Banks and Privacy Homomorphisms[C]//Proc. of IEEE Conference on Foundations of Secure Computation. [S. 1.]: Academic Press, 1978: 169-177.
[2] Gentry C. Fully Homomorphic Encryption Using Ideal Latt- ices[C]//Proc. of the 41th ACM Symposium on Theory of Computing. Annapolis, USA: [s. n.], 2009: 259-306.
[3] van Dijk M, Gentry C, Halevi S, et al. Fully Homomorphic Encryption over the Integers[C]//Proc. of EUROCRYPT’10. Riviera, France: [s. n.], 2010: 551-559.
[4] Smart N P, Vercauteren F. Fully Homomorphic Encryption with Relatively Small key and Ciphertext Sizes[C]//Proc. of the 13th IACR International Conference on Practice and Theory of Public-key Cryptography. Paris, France: [s. n.], 2010: 456-465.
[5] Gentry C, Halevi S. Implementing Gentry’s Fully Homo- morphic Encryption Scheme[C]//Proc. of EUROCRYPT’11. Tallinn, Estonia: [s. n.], 2011: 333-342.
[6] Coron J S, Mandal A, Naccache D, et al. Fully Homomorphic Encryption over the Integers with Shorter Public Keys[C]// Proc. of CRYPTO’11. Los Angeles, USA: [s. n.], 2011: 441-448.
[7] Brakerski Z, Vaikuntanathan V. Efficient Fully Homomorphic Encryption From(Standard) Lwe[C]//Proc. of the 52nd Annual IEEE Symposium on Foundations of Computer Science. Los Angeles, USA: [s. n.], 2011: 321-326.
[8] Gentry C, Halevi S, Smart N P. Fully Homomorphic Encryption with Polylog Overhead[C]//Proc. of EUROCRYPT’12. Cam- bridge, UK: [s. n.], 2012: 123-128.
[9] Gentry C, Halevi S, Smart N P. Better Bootstrapping in Fully Homomorphic Encryption[C]//Proc. of the 15th IACR International Conference on Practice and Theory of Public- key Cryptography. Darmstadt, Germany: [s. n.]: 2012: 213- 219.
[10] Hofheinz D, Unruh D. Towards Key-dependent Message Security in the Standard Model[C]//Proc. of EUROCRYPT’08. Istanbul, Turkey: [s. n.], 2008: 412-419.
[11] 陈智罡, 王 箭, 王梅娟. 整数上的全同态加密分析[C]// 2012中国密码年会论文集. 合肥: [出版者不详], 2012.
[12] Chen Y, Nguyen P Q. Faster Algorithms for Approximate Common Divisors: Breaking Fully Homomorphic Encryption Challenges over the Integers[C]//Proc. of EUROCRYPT 2012. Cambridge, UK: [s. n.], 2012: 219-226.
[13] Lee M S. On the Sparse Subset Sum Problem From Gentry-Halevis Implementation of Fully Homomorphic Encry- ption[EB/OL]. (2011-10-18). http://eprint.iacr.org/2011/ 567.
[14] Gennaro R, Gentry C, Parno B. Non-interactive Verifiable Computing: Outsourcing Computation to Nntrusted Workers[C]//
Proc. of CRYPTO’10. Santa Barbara, USA:[s. n.], 2010: 547-556.
[15] Loftus J, May A, Smart N P, et al. On Cca-secure Fully Homomorphic Encryption[C]//Proc. of the 18th International Conference on Selected Areas in Cryptography. Toronto, Canada: [s. n.], 2011: 321-331.
[16] Zhang Z F, Plantard T, Susilo W. On the Cca-1 Security of Somewhat Homomorphic Encryption over the Integers[C]// Proc. of the 8th International Conference on Information Security Practice and Experience. Hangzhou, China: [s. n.], 2012: 353-368.
[17] Hu Yupu, Wang Fenghe. An Attack on a Fully Homomorphic Encryption Scheme[EB/OL]. (2012-10-24). http://eprint.iacr. org/2012/561.
[18] Zhang Z F, Plantard T, Susilo W. Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes[C]//Proc. of the 14th Annual International Conference on Information Security and Cryptology. Seoul, Korea: [s. n.], 2011: 158-164.
[19] Chung K M, Kalai Y, Vadhan S. Improved Delegation of Computation Using Fully Homomorphic Encryption[C]//Proc. of CRYPTO’10. Santa Barbara, USA: [s. n.], 2010: 215-221.
[20] Benabbas S, Gennaro R, Vahlis Y. Verifiable Delegation of Computation over Large Datasets[C]//Proc. of CRYPTO’11. Santa Barbara, USA: [s. n.], 2011: 412-419.
[21] Papamanthou C, Shi E, Tamassia R. Publicly Verifiable Delegation of Computation[EB/OL]. (2011-11-16). http:// eprint.iacr.org/2011/587.
[22] Jin Fangyuan, Zhu Yanqin, Luo Xizhao. Verifiable Fully Homomorphic Encryption Scheme[C]//Proc. of the 2nd International Conference on Consumer Electronics, Com- munications and Networks. Yichang, China: [s. n.], 2012: 215-219.
[23] 靳方元, 朱艳琴, 罗喜召. 基于可验全同态加密的委托计算方案[J]. 计算机工程, 2012, 38(23): 150-153.
[24] Boneh D, Freeman D M. Homomorphic Signatures for Polynomial Functions[C]//Proc. of EUROCRYPT’11. Tallinn, Estonia: [s. n.], 2011: 333-339.
编辑 索书志 |