ninghui@cs.purdue.edu
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing; 2009. p. 169–78.
Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques; 1999. p. 223–38.
van Dijk M, Gentry C, Halevi S, Vaikuntanathan V. Fully homomorphic encryption over the integers. In: Advances in Cryptology: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques; 2010. p. 24–43.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Li, N. (2018). Homomorphic Encryption. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1486
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1486
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering