
A Proposed Fully Homomorphic for Securing Cloud Banking Data at Rest
Author(s) -
Zana Thalage Omar,
Fadhil Salman Abed
Publication year - 2020
Publication title -
uhd journal of science and technology
Language(s) - English
Resource type - Journals
eISSN - 2521-4217
pISSN - 2521-4209
DOI - 10.21928/uhdjst.v4n1y2020.pp87-95
Subject(s) - homomorphic encryption , encryption , computer science , cloud computing , homomorphic secret sharing , computer security , theoretical computer science , 56 bit encryption , scheme (mathematics) , arithmetic , multiple encryption , mathematics , operating system , cryptography , secure multi party computation , mathematical analysis
Fully homomorphic encryption (FHE) reaped the importance and amazement of most researchers and followers in data encryption issues, as programs are allowed to perform arithmetic operations on encrypted data without decrypting it and obtain results similar to the effects of arithmetic operations on unencrypted data. The first (FHE) model was introduced by Craig Gentry in 2009, and it was just theoretical research, but later significant progress was made on it, this research offers FHE system based on directly of factoring big prime numbers which consider open problem now, The proposed scheme offers a fully homomorphic system for data encryption and stores it in encrypted form on the cloud based on a new algorithm that has been tried on a local cloud and compared with two previous encryption systems (RSA and Paillier) and shows us that this algorithm reduces the time of encryption and decryption by 5 times compared to other systems.