Publisher
Springer International Publishing
Reference8 articles.
1. R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 120–126 (1978)
2. R.L. Rivest, L. Adleman, M. Dertouzos, On data banks and privacy homo-morphisms. Foundations of Secure Computation 169–180 (1978)
3. C. Gentry, A fully homomorphic encryption scheme, Ph.D. thesis (Stanford University, 2009)
4. C. Gentry, Fully homomorphic encryption using ideal lattices, in Symposium on the Theory of Computing (STOC ’09), Hrsg. von M. Mitzenmacher (2009), S. 169–178
5. C. Gentry, Toward basing fully homomorphic encryption on worst-case hardness, in Advances in cryptology – CRYPTO 2010, Bd. 6223, Lecture notes in computer science, Hrsg. von T. Rabin (2010), S. 116–137