Homomorphic encryption over databases

ISSN: 22783075
Citations of this article
Mendeley users who have this article in their library.


Human’s need for storing data efficiently is perpetual. when relying on third-party services for data storage, whether storing personal or critical data, even though claimed to be completely secure, cannot be trustworthy. During security breaches or situation of personal infringement of the service provider, the need for a mechanism which can be used to protect data from any kind of unauthorised disclosures. This paper aims to showcase the capability of an encryption method that is secure and powerful in providing security to users by encrypting their data by using Homomorphism. This research work includes protecting information through encrypting data, and decryption of this data should only occur if the authorized personal requests for such needs. Else, other entities in the system will be interacting with the data in a special format which is established by the algorithm, and able to manipulate the data in the database without decrypting it at any point of time. We present a system which uses homomorphic encryption on relational database that helps to ensure the security components like integrity, confidentiality and availability of the data. The architecture introduced in this paper, is designed to fire SQL queries over encrypted data, encrypted using Paillier encryption-scheme, and perform operation directly over the encrypted text as it would perform directly on plain text.




Ashok, J., Dheeraj, K. N., Subhedar, C., & Tiwari, R. (2019). Homomorphic encryption over databases. International Journal of Innovative Technology and Exploring Engineering, 8(8), 1983–1990.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free