[1] |
RIVEST R L , ADLEMAN L , DERTOUZOS M L . On data banks and privacy homomorphisms[A]. Foundations of Secure Computation[C]. 1978. 169-180.
|
[2] |
PAILLIER P . Public-key cryptosystems based on composite degree residuosity classes[A]. EUROCRYPT'99[C]. Spring, 1999. 223-238.
|
[3] |
RIVEST R L , SHAMIR A , ADLEMAN L . A method for obtaining digital signatures public key cryptosystem[J]. Communication of ACM, 1978,21(1): 120-126.
|
[4] |
BONEH D , GOH E J , NISSIM K . Evaluating 2-DNF formulas on ciphertexts[A]. Proceedings of Theory of Cryptography Conference 2005[C]. 2005. 325-342.
|
[5] |
GENTRY C . Fully homomorphic encryption using ideal lattices[A]. The 41st ACM Symposium on Theory of Computing (STOC)[C]. 2009. 169-178.
|
[6] |
GENTRY C . A Fully Homomorphic Encryption Scheme[D]. Standford:Stanford University, 2009.
|
[7] |
DIJK M , GENTRY C , HALEVI S ,et al. Fully homomorphic encryptionover the integers[A]. Cryptology-EUROCRYPT’10[C]. 2010. 24-43.
|
[8] |
SMART N , VERCAUTEREN F . Fully homomorphic encryption with relatively small key and ciphertext sizes[A]. PKC 2010[C]. 2010. 420-443.
|
[9] |
GENTRY C , HALEVI S . Implementing gentry’s fully-homomorphic encryption scheme[A]. EUROCRYPT,Lecture Notes in Computer Science[C]. 2011. 129-148.
|
[10] |
GENTRY C , HALEVI S . Fully homomorphic encryption without squashing using depth-3 arithmetic circuits[EB/OL]. , 2011.
|
[11] |
BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard)lwe[EB/OL]. , 2011.
|
[12] |
BRAKERSKI Z , GENTRY C . Fully homomorphic encryption without bootstrapping[EB/OL]. , 2011.
|
[13] |
LAUTER K , NAEHRIG M , VAIKUNTANATHAN V . Can homo morphic encryption be practical?[EB/OL]. , 2011.
|
[14] |
LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings[A]. EUROCRYPT,Lecture Notes in Computer Science[C]. 2010. 1-23.
|
[15] |
MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on gaussian measures[J].SIAM J Comput,2007.37(1):267-302. SIAM J Comput, 2007,37(1): 267-302.
|
[16] |
KARP R M , RAMACHANDRAN V . A Survey of Parallel Algorithms for Shared-Memory Machines[R]. Technical Report CSD-88-408,UC Berkeley, 1988.
|
[17] |
LINDNER R , PEIKERT C . Better key sizes (and attacks) for LWE-based encryption[A]. Cryptology-CT-RSA 2011,Lecture Notes in Computer Science[C]. 2011. 319-339.
|
[18] |
BANASZCZYK W . New bounds in some transference theorems in the geometry of numbers[J]. Mathematische Annalen, 1993,296(4): 625-635.
|
[19] |
GAMA N , NGUYEN P Q . Predicting lattice reduction[A]. Cryptology-EUROCRYPT 2008,Lecture Notes in Computer Science[C]. Springer, 2008. 31-51.
|