Design of Public-Key Algorithms Based on Partial Homomorphic Encryptions

Design of Public-Key Algorithms Based on Partial Homomorphic Encryptions

Marwan Majeed Nayyef (Anbar University, Baghdad, Iraq) and Ali Makki Sagheer (University of Anbar, Baghdad, Iraq)
Copyright: © 2019 |Pages: 19
DOI: 10.4018/IJISP.2019040105


With the rapid development of cloud computing, which has become a key aspect to maintain the security of user information that may be highly confidential and maintained during transport and storage process. The reliance on traditional algorithms that are used to encrypt data are not secure enough because we cannot process the data only after decrypt. In this article is proposed the use of homomorphic encryption to solve this problem because it can deal with encrypted data without the decryption, which can lead to ensuring confidentiality of the data. A number of public-key algorithms are explained, which is based on the concept of homomorphic encryption. In this article an algorithm is proposed based on HE and it is similar to Menesez-EC but with one digit as a secret key according to its advantage, whereby reducing the cost of communication, and storage and provides high processing speed when compared with other algorithms. This algorithm provides enough security for a bank's customer information and then compared with ECC, each of RSA and Piallier algorithms as evaluated.
Article Preview

2. Background

In 2012 Li Li, Ahmed A.Abd, XiamuNiu proposed new scheme with additive homomorphism property based on ElGamal-Elliptic Curve (ElGamal-EC) for transferring secret images over a channel which is unsecured instead of using ElGamal and RSA scheme. In this paper, the proposed scheme uses a shorter key to better performance than schemes based on ElGamal or RSA. Therefore, decryption of images requires lower processing compared with the method that uses the other additively homomorphic property in ElGamal-EC. Experimental results and analysis show that the proposed method is faster and has superior performance for RSA and ElGamal (Li, Abd El-Latif, & Xiamu, 2012).

In 2015, Kamal Kumar Chauhan; Amit K.S. Sanger, A. Verma, a secure method was developed for keeping data, Data security is an important aspect, especially when data transfer and storage over the internet (cloud computing), therefore various methods of standard encryption algorithm provide security for data in storage and transmission. In the traditional state data to be processed must be decrypted first, but this state makes data understandable to a cloud provider. Standard encryption algorithms are not sufficient to make data more secure. In this paper various schemes are proposed such as (Pillar, RSA, and Boneh-Goh-Nissim (BGN)) based on homomorphic encryption in cloud computing in order to secure data through processing state because of Homomorphic encryption allows the service provider to operate on ciphertext without decryption. The implementation of these schemes helps to provide security for data stored in cloud computing (Chauhan, Sanger, & Verma, 2015).

Complete Article List

Search this Journal:
Open Access Articles
Volume 15: 4 Issues (2021): 1 Released, 3 Forthcoming
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing