[1] Rivest R, Adleman L, Dertouzos M. On Data Banks and Privacy Homomorphisms[M]. [S. l.]: Academic Press, 1978: 169-177. [2] Lipton B. Searching for Elements in Black Box Fields and Applications[C]//Proc. of Cryptology-Crypto’96. [S. l.]: Springer- Verlag, 1996: 283-297. [3] Domingo-Ferrer J. A Provably Secure Additive and Multiplicative Privacy Homomorphism[C]//Proc. of the 5th International Conference on Information Security. [S. l.]: Springer-Verlag, 2002: 471-483. [4] Brickell E F, Yacobi Y. On Privacy Homomorphisms[C]//Proc. of Cryptology-EuroCrypt’87. Berlin, Germany: Springer-Verlag, 1987: 117-126. [5] Feigenbaum J, Merritt M. Open Question, Talk Abstracts, and Summary of Discussions[EB/OL]. (1991-12-05). http://biblioteca. universia.net/html_bura/ficha/params/title/open-questions-talk-abstracts-and-summary-of-discussions/id/46640945.html. [6] Fellows M, Koblitz N. Combinatorial Cryptosystems Galore![Z]. 1993. [7] Gentry C. Fully Homomorphic Encryption Using Ideal Lattice[C]// Proc. of STOC’09. [S. l.]: IEEE Press, 2009: 169-178. [8] van Dijk M, Gentry C, Halevi S, et al. Fully Homomorphic Encryption over the Integers[C]//Proc. of Cryptology-CRYPTO’11. [S. l.]: Springer-Verlag, 2011: 24-43. [9] Gentry C, Halevi S. Fully Homomorphic Encryption Without Squashing Using Depth-3 Arithmetic Circuits[C]//Proc. of FOCSIEEE’11. [S. l.]: Springer-Verlag, 2011. [10] Melchor C A, Castagnos G, Gaborit P. Lattice-based Homomorphic Encryption of Vector Spaces[C]//Proc. of ISIT’08. [S. l.]: IEEE Press, 2008: 1858-1862. [11] Coron J S, Mandal A, Naccache D, et al. Fully Homomorphic Encryption over the Integers with Shorter Public-keys[C]//Proc. of the 31st Annual Conference on Advances in Cryptology. Berlin, Germany: Springer-Verlag, 2011. [12] Chen Y, Nguyen P Q. Faster Algorithms for Approximate Common Divisors: Breaking Fully-homomorphic-encryption Challenges over the Integers[C]//Proc. of Cryptology-EUROCRYPT’12. [S. l.]: Springer-Verlag, 2012. [13] Chung K M, Kalai Y T, Vadhan S. Improved Delegation of Computation Using Fully Homomorphic Encryption[C]//Proc. of the 30th Annual Conference on Advances in Cryptology. Berlin, Germany: Springer-Verlag, 2010. [14] Silvano M, Paolo T. Knapsack Problems: Algorithms and Computer Interpretations[M]. [S. l.]: Wiley-Interscience, 1990. [15] Pfitzmann B, Waidner M. Attacks on Protocols for Server-aided RSA Computation[C]//Proc. of EUROCRYPT’92. Berlin, Germany: Springer-Verlag, 1992. [16] Nguyen P Q, Shparlinski I. On the Insecurity of a Server-aided RSA Protocol[C]//Proc. of ASIACRYPT’01. London, UK: Springer-Verlag, 2001: 21-35.
|