On the CCA-1 security of somewhat homomorphic encryption over the integers

Authors:
Zhenfei Zhang;Thomas Plantard;Willy Susilo
Affiliations:
Centre for Computer and Information Security Research, School of Computer Science & Software Engineering (SCSSE), University Of Wollongong, Australia;Centre for Computer and Information Security Research, School of Computer Science & Software Engineering (SCSSE), University Of Wollongong, Australia;Centre for Computer and Information Security Research, School of Computer Science & Software Engineering (SCSSE), University Of Wollongong, Australia
Venue:
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Year:
2012

Citing 11
Cited 0

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Public-Key Cryptosystems from Lattice Reduction Problems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the forty-first annual ACM symposium on Theory of computing

Symposium on Theory of Computing Conference
Fully homomorphic encryption using ideal lattices

Proceedings of the forty-first annual ACM symposium on Theory of computing
A fully homomorphic encryption scheme

A fully homomorphic encryption scheme
Implementing Gentry's fully-homomorphic encryption scheme

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Fully homomorphic encryption over the integers with shorter public keys

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fully homomorphic encryption from ring-LWE and security for key dependent messages

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fully homomorphic encryption with relatively small key and ciphertext sizes

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Fully homomorphic encryption over the integers

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of fully homomorphic encryption is very important since it enables many important applications, such as the cloud computing scenario. In EUROCRYPT 2010, van Dijk, Gentry, Halevi and Vaikuntanathan proposed an interesting fully homomorphic encryption scheme based on a somewhat homomorphic encryption scheme using integers. In this paper, we demonstrate a very practical CCA-1 attack against this somewhat homomorphic encryption scheme. Given a decryption oracle, we show that within O(λ2) queries, we can recover the secret key successfully, where λ is the security parameter for the system.