Public key and levelled attributes access policy oriented fully homomorphic encryption scheme
by V. Biksham; D. Vasumathi
International Journal of Computing Science and Mathematics (IJCSM), Vol. 12, No. 1, 2020

Abstract: Fully homomorphic encryption (FHE) has been considered as significant transition of cryptography, a difficult aim which could answer the world's obstacles of security and trust. FHE is also considered among the golden solutions for achieving security in cloud computation, MPC, data banks, etc. FHE was conceptualised in 1978, but it took approximately three decades to invent the first credible construction of FHE. The research in this area erupted after Craig Gentry's construction of FHE in 2009. Considerable developments have been made in getting more practical and efficient solutions. In this paper, we have gathered the state of art information in this field through surveying various schemes. We proposed detailed construction of our fully homomorphic system. The security and correctness analysis for the proposed procedure along with the experimental results are also given in the paper.

Online publication date: Mon, 03-Aug-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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