[Resource Topic] 2013/250: Fully Homomorphic Encryption for Mathematicians

Welcome to the resource topic for 2013/250

Fully Homomorphic Encryption for Mathematicians

Authors: Alice Silverberg


We give an introduction to Fully Homomorphic Encryption for mathematicians. Fully Homomorphic Encryption allows untrusted parties to take encrypted data Enc(m_1),…,Enc(m_t) and any efficiently computable function f, and compute an encryption of f(m_1,…,m_t), without knowing or learning the decryption key or the raw data m_1,…,m_t. The problem of how to do this was recently solved by Craig Gentry, using ideas from algebraic number theory and the geometry of numbers. In this paper we discuss some of the history and background, give examples of Fully Homomorphic Encryption schemes, and discuss the hard mathematical problems on which the cryptographic security is based.

ePrint: https://eprint.iacr.org/2013/250

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .