Comparison-Based Attacks Against Noise-Free Fully Homomorphic Encryption Schemes

Homomorphic Encryption provides one of the most promising means to delegate computation to the cloud while retaining data confidentiality. We present a plaintext recovery attack against fully homomorphic schemes which have a polynomial time distinguisher for a given fixed plaintext, and rely on the capability of homomorphically compare a pair of encrypted integer values. We improve by a constant factor the computational complexity of an exhaustive search strategy, which is linear in the recovered plaintext value, and show that it significantly increases the number of recoverable plaintexts. We successfully validate our attack against two noise-free fully homomorphic encryption schemes, which fulfill the mentioned requisite and were claimed to be secure against plaintext recovery attacks.

[1]  Vinod Vaikuntanathan,et al.  Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.

[2]  Craig Gentry,et al.  Fully Homomorphic Encryption with Polylog Overhead , 2012, EUROCRYPT.

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

[4]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[5]  Berk Sunar,et al.  An Investigation of Complex Operations with Word-Size Homomorphic Encryption , 2015, IACR Cryptol. ePrint Arch..

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

[7]  Praveen Gauravaram,et al.  Performance Analysis of Sorting of FHE Data: Integer-Wise Comparison vs Bit-Wise Comparison , 2017, 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA).

[8]  Vinod Vaikuntanathan,et al.  Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[9]  Chris Peikert,et al.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..

[10]  Brent Waters,et al.  Functional Encryption: Definitions and Challenges , 2011, TCC.

[11]  Zvika Brakerski,et al.  Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP , 2012, CRYPTO.

[12]  Nicolas Gama,et al.  Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds , 2016, ASIACRYPT.

[13]  David Pointcheval,et al.  Advances in Cryptology – EUROCRYPT 2012 , 2012, Lecture Notes in Computer Science.

[14]  Koji Nuida.  A Simple Framework for Noise-Free Construction of Fully Homomorphic Encryption from a Special Class of Non-Commutative Groups , 2014, IACR Cryptol. ePrint Arch..

[15]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

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

[17]  Vinod Vaikuntanathan,et al.  Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

[19]  Boaz Tsaban,et al.  Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme , 2015, J. Math. Cryptol..

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

[21]  Aviad Kipnis,et al.  Efficient Methods for Practical Fully Homomorphic Symmetric-key Encrypton, Randomization and Verification , 2012, IACR Cryptol. ePrint Arch..

[22]  Andrew Chi-Chih Yao,et al.  Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.

[23]  Yongge Wang,et al.  Privacy Preserving Computation in Cloud Using Noise-Free Fully Homomorphic Encryption (FHE) Schemes , 2016, ESORICS.

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