Cryptology ePrint Archive: Report 2014/610

Computing on the Edge of Chaos: Structure and Randomness in Encrypted Computation

Craig Gentry

Abstract: This survey, aimed mainly at mathematicians rather than practitioners, covers recent developments in homomorphic encryption (computing on encrypted data) and program obfuscation (generating encrypted but functional programs). Current schemes for encrypted computation all use essentially the same "noisy" approach: they encrypt via a noisy encoding of the message, they decrypt using an "approximate" ring homomorphism, and in between they employ techniques to carefully control the noise as computations are performed. This noisy approach uses a delicate balance between structure and randomness: structure that allows correct computation despite the randomness of the encryption, and randomness that maintains privacy against the adversary despite the structure. While the noisy approach "works", we need new techniques and insights, both to improve efficiency and to better understand encrypted computation conceptually.

Category / Keywords: public-key cryptography / homomorphic encryption, obfuscation, learning with errors

Original Publication (in the same form): International Congress of Mathematicians (ICM) 2014

Date: received 9 Aug 2014

Contact author: cbgentry at us ibm com

Available format(s): PDF | BibTeX Citation

Version: 20140813:233621 (All versions of this report)

Short URL: ia.cr/2014/610

Discussion forum: Show discussion | Start new discussion