Reaction attack on outsourced computing with fully homomorphic encryption schemes

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:
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Year:
2011

Citing 13
Cited 0

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Reaction Attacks against several Public-Key Cryptosystems

ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Fully homomorphic encryption using ideal lattices

Proceedings of the forty-first annual ACM symposium on Theory of computing
Computing arbitrary functions of encrypted data

Communications of the ACM
Bit Encryption Is Complete

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
A fully homomorphic encryption scheme

A fully homomorphic encryption scheme
i-hop homomorphic encryption and rerandomizable Yao circuits

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Non-interactive verifiable computing: outsourcing computation to untrusted workers

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
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 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
On CCA-Secure somewhat homomorphic encryption

SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Outsourced computations enable more efficient solutions towards practical problems that require major computations. Nevertheless, users' privacy remains as a major challenge, as the service provider can access users' data freely. It has been shown that fully homomorphic encryption schemes might be the perfect solution, as it allows one party to process users' data homomorphically, without the necessity of knowing the corresponding secret keys. In this paper, we show a reaction attack against full homomorphic schemes, when they are used for securing outsourced computation. Essentially, our attack is based on the users' reaction towards the output generated by the cloud. Our attack enables us to retrieve the associated secret key of the system. This secret key attack takes O(λlogλ) time for both Gentry's original scheme and the fully homomorphic encryption scheme over integers, and O(λ) for the implementation of Gentry's fully homomorphic encryption scheme.