1. Regev O, On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM (JACM), 2009, 56(6): 1–40.
2. Lyubashevsky V, Peikert C, and Regev O, On ideal lattices and learning with errors over rings, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, 2010, 6110: 1–23.
3. Brakerski Z and Vaikuntanathan V, Fully homomorphic encryption from ring-LWE and security for key dependent messages, Annual Cryptology Conference, Springer, Berlin, 2011, 6841: 505–524.
4. Li B and Micciancio D, On the security of homomorphic encryption on approximate numbers, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, 2021, 12696: 648–677.
5. Raisaro J L, Klann J G, Wagholikar K B, et al., Feasibility of homomorphic encryption for sharing I2B2 aggregate-level data in the cloud, AMIA Summits on Translational Science Proceedings, 2018, 2017: 176–185.