Skip to main content

Homomorphic Encryption

  • Reference work entry
  • First Online:

Definition

Homomorphic encryption is a form of public-key encryption where one can perform a specific algebraic operation on the plaintext by performing an (possibly different) algebraic operation on the ciphertext. For example, knowing only C1 = (x) and C2 = (y), but not x, y, one may be able to get (x + y) by calculating C1 × C2. A homomorphic encryption scheme allows a third party to operate on encrypted values without knowing the plaintext.

Key Points

Depending on the intended application, the homomorphic property can be seen as a positive or negative attribute of the cryptosystem. Homomorphic encryption schemes are malleable by design. On the other hand, the ability to enable manipulating ciphertexts without being able to decrypt can be very useful in some applications.

A fully homomorphic encryption scheme enables one to perform operations on the ciphertext to achieve both addition and multiplication on the enclosed plaintext. This enables one to compute arbitrary functions on...

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing; 2009. p. 169–78.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ninghui Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

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

Publish with us

Policies and ethics