[1] |
RIVEST R L , ADLEMAN L , DERTOUZOS M L . On data banks and privacy homomorphisms[J]. Foundations of Secure Computation, 1978, 4 (11): 169-180.
|
[2] |
GENTRY C . Fully homomorphic encryption using ideal lattices[C]// The 41st Annual ACM Symposium on Theory of Computing. 2009: 169-178.
|
[3] |
SMART N P , VERCAUTEREN F . Fully homomorphic encryption with relatively small key and ciphertext sizes[M]// Public Key Cryptography-PKC 2010. Berlin: Springer, 2010: 420-443.
|
[4] |
DIJK M V , GENTRY C , HALEVI S , et al. Fully homomorphic encryption over the integers[M]// Advances in Cryptology-Eurocrypt 2010. Berlin: Springer, 2010: 24-43.
|
[5] |
JEAN-SéBASTIEN C , AVRADIP M , NACCACHE D , et al. Fully homomorphic encryption over the integers with shorter public keys[M]// Advances in Cryptology-CRYPTO 2011. Berlin Heidelberg: Springer, 2011: 487-504.
|
[6] |
JEAN-SéBASTIEN C , NACCACHE D , TIBOUCHI M . Public key compression and modulus switching for fully homomorphic encryption over the integers[M]// Advances in Cryptology-Eurocrypt 2012. Berlin Heidelberg: Springer, 2012: 446-464.
|
[7] |
BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard) LWE[C]// IEEE 52nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society. 2011: 97-106.
|
[8] |
BRAKERSKI Z , GENTRY C , VAIKUNTANATHAN V . (Leveled) fully homomorphic encryption without bootstrapping[C]// The 3rd Innovations in Theoretical Computer Science Conference. 2012: 309-325.
|
[9] |
BRAKERSKI Z . Fully homomorphic encryption without modulus switching from classical gapSVP[M]// Advances in Cryptology-CRYPTO 2012. Berlin Heidelberg: Springer, 2012: 868-886.
|
[10] |
GENTRY C , SAHAI A , WATERS B . Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based[M]// Advances in Cryptology-CRYPTO 2013. Berlin Heidelberg: Springer, 2013: 75-92.
|
[11] |
LóPEZ-ALT A , TROMER E , VAIKUNTANATHAN V . On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption[C]// The 44th Symposium on Theory of Computing. 2012: 1219-1234.
|
[12] |
CHEN Z G , WANG J , ZHANG Z N , et al. A fully homomorphic encryption scheme with better key size[J]. China Communications, 2014, 11 (9): 89-99.
|
[13] |
REGEV O . On lattices, learning with errors, random linear codes, and cryptography[C]// The 37th Annual ACM Symposium on Theory of Computing. 2005: 84-93.
|
[14] |
LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings[M]// Advances in Cryptology-EUROCRYPT 2010. Berlin Heidelberg: Springer, 2010: 1-23.
|
[15] |
STEHLé D , STEINFELD R . Making NTRU as secure as worst-case problems over ideal lattices[M]// Advances in Cryptology-EUROCRYPT 2011. Berlin Heidelberg: Springer, 2011: 27-47.
|
[16] |
GENTRY C , HALEVI S , VAIKUNTANATHAN V . simple BGN-type cryptosystem from LWE[M]// Advances in Cryptology –EUROCRYPT 2010. Berlin Heidelberg: Springer, 2010: 506-522.
|
[17] |
BONEH D , GOH E J , NISSIM K . Evaluating 2-DNF formulas on ciphertexts[C]// Theory of Cryptography: Second Theory of Cryptography Conference(TCC 2005). 2005: 325-41.
|
[18] |
BRAKERSKI Z , VAIKUNTANATHAN V . Lattice-based FHE as secure as PKE[C]// The 5th Conference on Innovations in Theoretical Computer Science. 2014: 1-12.
|
[19] |
陈智罡, 宋新霞, 赵秀凤 . 一个LWE上的短公钥多位全同态加密方案[J]. 计算机研究与发展, 2016, 53 (10): 2216-2223.
|
|
CHEN Z G , SONG X X , ZHAO X F . A multi-bit fully homomorphic encryption with better key size from LWE[J]. Journalof Computer Research and Development, 2016, 53 (10): 2216-2223.
|
[20] |
陈智罡, 石亚峰, 宋新霞 . 全同态加密具体安全参数分析[J]. 密码学报, 2016, 3 (5): 480-491.
|
|
CHEN Z G , SHI Y F , SONG X X . Estimating concert security parameters of fully homomorphic encryption[J]. Journal of Cryptologic Research, 2016, 3 (5): 480-491.
|
[21] |
陈智罡, 王箭, 宋新霞 . 全同态加密研究[J]. 计算机应用与研究, 2014, 31 (6): 1624-1631.
|
|
CHEN Z G , WANG J , SONG X X . Survey on fully homomorphic encryption[J]. Application Research of Computer, 2014, 31 (6): 1624-1631.
|