Fully Homomorphic Encryption for Mathematicians

@article{Silverberg2013FullyHE,
  title={Fully Homomorphic Encryption for Mathematicians},
  author={Alice Silverberg},
  journal={IACR Cryptology ePrint Archive},
  year={2013},
  volume={2013},
  pages={250}
}
We give an introduction to Fully Homomorphic Encryption for mathematicians. Fully Homomorphic Encryption allows untrusted parties to take encrypted data Enc(m1), . . . ,Enc(mt) and any efficiently computable function f , and compute an encryption of f(m1, . . . ,mt), without knowing or learning the decryption key or the raw data m1, . . . ,mt. 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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…