Fully homomorphic encryption with applications to electronic voting

Fully homomorphic encryption (FHE) has been dubbed the holy grail of cryptography, an elusive goal which could solve the IT world’s problems of security and trust. Research in the area exploded after 2009 when Craig Gentry showed that FHE can be realised in principle. Since that time considerable progress has been made in finding more practical and more efficient solutions. Whilst research quickly developed, terminology and concepts became diverse and confusing so that today it can be difficult to understand what the achievements of different works actually are. The purpose of this paper is to address three fundamental questions: What is FHE? What can FHE be used for? What is the state of FHE today? As well as surveying the field, we clarify different terminology in use and prove connections between different FHE notions.

[1]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[2]  Lajos Rónyai,et al.  Polynomial time solutions of some problems of computational algebra , 1985, STOC '85.

[3]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[4]  Craig Gentry.  Computing on the edge of chaos: Structure and randomness in encrypted computation , 2014, Electron. Colloquium Comput. Complex..

[5]  Stefan Katzenbeisser,et al.  Shift-Type Homomorphic Encryption and Its Application to Fully Homomorphic Encryption , 2012, AFRICACRYPT.

[6]  Byoungcheon Lee,et al.  Multiplicative Homomorphic E-Voting , 2004, INDOCRYPT.

[7]  Frederik Vercauteren,et al.  Somewhat Practical Fully Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..

[8]  Murray R. Bremner,et al.  How to compute the Wedderburn decomposition of a finite-dimensional associative algebra , 2010, Groups Complex. Cryptol..

[9]  Nigel P. Smart,et al.  Which Ring Based Somewhat Homomorphic Encryption Scheme is Best? , 2015, CT-RSA.

[10]  Kazue Sako,et al.  Efficient Receipt-Free Voting Based on Homomorphic Encryption , 2000, EUROCRYPT.

[11]  Vinod Vaikuntanathan,et al.  On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption , 2012, STOC '12.

[12]  Dongxi Liu.  Practical Fully Homomorphic Encryption without Noise Reduction , 2015, IACR Cryptol. ePrint Arch..

[13]  K. Nuida.  Candidate Constructions of Fully Homomorphic Encryption on Finite Simple Groups without Ciphertext Noise , 2015 .

[14]  Frederik Armknecht,et al.  A Guide to Fully Homomorphic Encryption , 2015, IACR Cryptol. ePrint Arch..

[15]  Vadim Lyubashevsky,et al.  Lattice-Based Identification Schemes Secure Under Active Attacks , 2008, Public Key Cryptography.

[16]  I. Gel'fand,et al.  Determinants of matrices over noncommutative rings , 1991 .

[17]  H. Lenstra.  Finding isomorphisms between finite fields , 1991 .

[18]  Craig Gentry,et al.  A fully homomorphic encryption scheme , 2009 .

[19]  Brent Waters,et al.  Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.

[20]  Craig Gentry,et al.  Fully Homomorphic Encryption without Bootstrapping , 2011, IACR Cryptol. ePrint Arch..

[21]  Jung Hee Cheon,et al.  Batch Fully Homomorphic Encryption over the Integers , 2013, EUROCRYPT.

[22]  Stefan Katzenbeisser,et al.  Group homomorphic encryption: characterizations, impossibility results, and applications , 2013, Des. Codes Cryptogr..

[23]  Frederik Armknecht,et al.  General Impossibility of Group Homomorphic Encryption in the Quantum World , 2014, Public Key Cryptography.

[24]  Vadim Lyubashevsky,et al.  Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures , 2009, ASIACRYPT.

[25]  Frederik Vercauteren,et al.  Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes , 2010, Public Key Cryptography.

[26]  Chris Peikert,et al.  On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.

[27]  Christopher J. Hillar,et al.  Automorphisms of Finite Abelian Groups , 2006, Am. Math. Mon..

[28]  Jing Li,et al.  Noise-free Symmetric Fully Homomorphic Encryption based on noncommutative rings , 2015, IACR Cryptol. ePrint Arch..

[29]  Richard J. Lipton,et al.  Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract) , 1996, CRYPTO.

[30]  Yongge Wang.  Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping , 2015, IACR Cryptol. ePrint Arch..

[31]  Claude Carlet,et al.  Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts , 2016, EUROCRYPT.

[32]  Zvika Brakerski.  When Homomorphism Becomes a Liability , 2012, IACR Cryptol. ePrint Arch..

[33]  Ron Steinfeld,et al.  Faster Fully Homomorphic Encryption , 2010, ASIACRYPT.

[34]  Kaoru Kurosawa,et al.  (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces , 2014, EUROCRYPT.

[35]  Ronald L. Rivest,et al.  ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .

[36]  Berk Sunar,et al.  Homomorphic AES evaluation using the modified LTV scheme , 2016, Des. Codes Cryptogr..

[37]  Frederik Vercauteren,et al.  Fully homomorphic SIMD operations , 2012, Designs, Codes and Cryptography.

[38]  Kristian Gjøsteen,et al.  Can there be efficient and natural FHE schemes ? ? , 2016 .

[39]  Niv Ahituv,et al.  Processing encrypted data , 1987, CACM.

[40]  P. B. Bhattacharya,et al.  Basic Abstract Algebra , 1986 .

[41]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[42]  Michael Naehrig,et al.  Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme , 2013, IMACC.