Efficient public key Homomorphic Encryption over integer plaintexts

Ramaiah, Y. Govinda; Kumari, G. Vijaya

doi:10.1109/isic.2012.6449723

Cited by 21 publications

(8 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It should be noted that any multiplicatively and additively homomorphic encryption scheme over integers with publickeys can be used for this framework. Here we choose the HE L encryption scheme in [51]. Its security is ensured due to the hard problem of solving the two-element Partial Approximate Greatest Common Divisor.…”

Section: A Selected Scheme-he Lmentioning

confidence: 99%

Homomorphic Encryption of Supervisory Control Systems Using Automata

Zhou

Nasr

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Cyber-physical systems have been highly integrated into many contemporary infrastructures. As this integration deepens, the importance of protecting these systems from unauthorized access and data corruption increases. Nowadays, cyber-physical systems are not well protected against network attacks. One solution is to improve the security of a system by encrypting the transmitted data. In this paper, we consider the encryption of supervisors of discrete event systems modeled with deterministic finite-state automata. We propose an encryption framework of supervisory control systems based on the matrix notation of automata. The purpose of using matrix notation is to make it suitable for homomorphic encryption schemes over integers, which are emerging in the cryptography area. We calculate the entropy of the matrix notation and find that as the size of a system increases, it gets smaller and approaches zero. Owing to the low entropy of the matrix notation, we propose an algorithm to enhance its entropy. By applying the entropy-enhancing process, the distribution characteristics of entries in matrices or vectors can be hidden to avoid a brute force attack. Correspondingly, we propose an entropy restoration algorithm to ensure that the control action can be transmitted correctly.

show abstract

Section: A Selected Scheme-he Lmentioning

confidence: 99%

Homomorphic Encryption of Supervisory Control Systems Using Automata

Zhou

Nasr

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Faster improvement to Gentry's model is proposed by Stehle and Steinfield [15]. Y Govinda Ramaiah [16] has proposed "Efficient Public Key Homomorphic Encryption over Integer Plaintexts".…”

Section: Related Workmentioning

confidence: 99%

Design of fully homomorphic encryption by prime modular operation

Sarah¹,

Ali²

2018

Telfor J

View full text Add to dashboard Cite

The meaning of cloud computing is the Information Technology (IT) model for computing, which consists of all the IT components (software, hardware, services and, networking) that are needed to enable the delivery and development of cloud services through a private network or the internet. In cloud computing, the client (user) puts his data in the cloud, and any computations on his stored data will be implemented in the cloud. Security is the main thing in cloud computing because a service provider can access, intentionally change or even delete the stored data. To protect data that is stored in the cloud, it is necessary to use an encryption system that can perform computations on the encrypted data. The scheme that allows executing several computations on the encrypted message without decrypting the message is called homomorphic encryption. The implementation of fully homomorphic encryption over the integer (DGHV scheme) and a Simple Fully Homomorphic Encryption Scheme Available in Cloud Computing (SDC Scheme), are slow in execution time because all of them convert the message to a binary format and then encrypt it. Therefore, we propose another scheme called Fully Homomorphic encryption based on a prime modular operation, this scheme encrypts the message character by character by using a prime secret key without converting that character into a binary format. As a result, we compute the time complexity and compare the execution time among the three schemes and analyse the security of the three schemes.

show abstract

“…[16] suggest a faster improvement to Gentry's model. Ramaiah et al [17] has proposed an Efficient public key homomorphic encryption over integer plaintexts.…”

Section: Related Workmentioning

confidence: 99%

Homomorphic Encryption Techniques for securing Data in Cloud Computing: A Survey

Biksham¹,

Vasumathi²

2017

IJCA

View full text Add to dashboard Cite

Cloud computing is an arising computational model, where data and its several services associated with its scalable data centers in the cloud and can be obtained from the Internet. Computing gives an added amount of risk as vital services which are usually deployed to any third party, which creates the difficulty to enable data security, privacy factor, confidentiality, integrity, and authentication. Most of the users prefer to store their data inside the cloud in an encrypted/unoriginal format to decrease the security concerns. However, to perform any operation on data at server, cloud needs to first decrypt the data. This operation might cause the challenging issues like -confidentiality along with privacy of confidential data, stored inside the cloud. Here, This paper presents state of the art in this Homomorphic Encryption (HE) domain, and solve the problems of confidentiality and privacy of stored data in a cloud. HE is a kind of encryption mechanism that give ability to users for computations to be prosecuted on cipher text itself, thus producing an unoriginal/encrypted result when decrypted it shows similarity on the result of operations prosecuted on the plain text. Homomorphic Encryption is generally of two types i.e. Partial Homomorphic encryption (PHE) and Fully Homomorphic Encryption (FHE). FHE considered to be as more secure and efficient in the form of third party computations, since it gains the advantage of both properties -Additive as well as multiplicative homomorphism. Based on the research done in past years, identification of the problem in the existing system is also presented in this paper and have given our future research directions.

show abstract

Efficient public key Homomorphic Encryption over integer plaintexts

Cited by 21 publications

References 9 publications

Homomorphic Encryption of Supervisory Control Systems Using Automata

Homomorphic Encryption of Supervisory Control Systems Using Automata

Design of fully homomorphic encryption by prime modular operation

Homomorphic Encryption Techniques for securing Data in Cloud Computing: A Survey

Contact Info

Product

Resources

About