Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st annual ACM symposium on theory of computing STOC 09, 2009. 19 September. (7)9.
2. Wang C, Cao N, Li J, et al. Secure ranked keyword search over encrypted cloud data. In: Proceedings-30th IEEE International Conference on Distributed Computing Systems. Genova, Itay, 2010. p. 253–262.
3. Rivest RL, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM. 1978;21(2):120–6.
4. Brakerski Z, Vaikuntanathan V. Fully homomorphic encryption from ring-LWE and security for key dependent messages, vol. 6841. LNCS. Lecture notes in computer science. 2011. pp. 505–524.
5. Gentry C, Halevi S, Smart NP. Homomorphic evaluation of the AES circuit, vol. 7417. LNCS. Lecture notes in computer science. 2012. pp.850–867.