Title: Public key and levelled attributes access policy oriented fully homomorphic encryption scheme

Authors: V. Biksham; D. Vasumathi

Addresses: Department of Computer Science and Engineering, Sreyas Institute of Engineering and Technology, Hyderabad, India; Department of Computer Science and Engineering, Jawaharlal Nehru Technological University, Hyderabad, India ' Department of Computer Science and Engineering, Jawaharlal Nehru Technological University, Hyderabad, India

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.

Keywords: fully homomorphic encryption; lattice-based encryption; secure outsourcing; learning with errors; attribute-based encryption; privacy.

DOI: 10.1504/IJCSM.2020.108780

International Journal of Computing Science and Mathematics, 2020 Vol.12 No.1, pp.51 - 63

Received: 06 Mar 2019
Accepted: 29 Jul 2019

Published online: 27 Jul 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article