Cryptology ePrint Archive: Report 2013/250
Fully Homomorphic Encryption for Mathematicians
Abstract: 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.
Category / Keywords:
Publication Info: To appear in the WIN2 Proceedings.
Date: received 1 May 2013, last revised 28 May 2013
Contact author: asilverb at uci edu
Available format(s): PDF | BibTeX Citation
Version: 20130529:050651 (All versions of this report)
Short URL: ia.cr/2013/250
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]