1. Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 21(2), 120–126.
2. Gentry, C. (2009). Fully homomorphic encryption using ideal lattices[C]. Proceedings of the forty-first annual ACM symposium on Theory of computing, 1, 169–178.
3. Smart, N. P., & Vercauteren, F. (2010). Fully homomorphic encryption with relatively small key and ciphertext sizes[C], 420–443. Springer, Berlin, Heidelberg: International Workshop on Public Key Cryptography.
4. Van Dijk, M., Gentry, C., & Halevi, S., et al. (2010). Fully homomorphic encryption over the integers[C], 24-43,Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, Heidelberg
5. Sun, Y., Chen, Y., & Wang, X., et al. (2014). Deep learning face representation by joint identification-verification[C]. Advances in neural information processing systems, , 1988–1996