Research Article
Efficient Public Key Generation for Homomorphic Encryption over the Integers
@INPROCEEDINGS{10.1007/978-3-642-35615-5_40, author={Y. Ramaiah and G. Kumari}, title={Efficient Public Key Generation for Homomorphic Encryption over the Integers}, proceedings={Third International conference on advances in communication, network and computing}, proceedings_a={CNC}, year={2012}, month={12}, keywords={Homomorphic Encryption Key Generation Security Practicality}, doi={10.1007/978-3-642-35615-5_40} }- Y. Ramaiah
G. Kumari
Year: 2012
Efficient Public Key Generation for Homomorphic Encryption over the Integers
CNC
Springer
DOI: 10.1007/978-3-642-35615-5_40
Abstract
The ‘Holy Grail’ of cryptography called Fully Homomorphic Encryption (FHE), which allows encrypted data processing and delegation of computational tasks to the remote untrusted server, has become a hot research topic in light of the privacy concerns related to cloud computing. Several FHE schemes were found after the first construction of such scheme by Craig Gentry in 2009. One of the several reasons making these theoretically feasible schemes unpractical is their high computational costs. In this paper, a simplest possible key generation method is proposed for the somewhat homomorphic scheme of Van Dijk et al., which leads to an efficient integer based FHE scheme. Also, the security and practicality of the proposed scheme is thoroughly analyzed with respect to the new key generation method suggested.
