A new fully homomorphic encryption over the integers using smaller public key Online publication date: Wed, 28-Sep-2016
by Yeluripati Govindha Ramaiah; Gunta Vijaya Kumari
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 8, No. 4, 2016
Abstract: Fully homomorphic encryption scheme with practical time complexity is a widely acknowledged research problem in cryptography. In this work, a new somewhat homomorphic encryption with practical time complexities is proposed, from which fully homomorphic encryption is obtained using the optimisations suggested in the contemporary works. The central idea behind the proposition in achieving such reasonable time complexities lies in employing a small public key containing only two big integers with consequent reduction in the message expansion. The scheme may be considered as a variant of the DGHV's integers-based scheme, which was one of the earlier attempts in devising a conceptually simpler fully homomorphic encryption. The semantic security of the proposition is proved in the standard model by reducing the same to the hard problem of solving partial approximate greatest common divisor of two integers.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook