Title: A novel method of fully homomorphic encryption scheme

Authors: Sonam Mittal; A.K. Suntheya; R. Anbunathan; N. Ashokkumar

Addresses: Department of Computer Science and Engineering, Chitkara University Institute of Engineering and Technology, 140401, India ' Department of Computer Science and Engineering, Panimalar Engineering College, 600029, India ' Department of Maths, S.A. Engineering College, 600077, India ' Department of ECE, Mohan Babu University, 517102, India

Abstract: Fully homomorphic encryption, often known as FHE, is an alternative to traditional cryptography that lets arbitrary functions be evaluated on encrypted data without the need of first decrypting the ciphertexts. This paper proposes a novel method of FHE scheme. Homomorphic encryption is a class of encryption algorithms that had previously been envisioned by Rivest, Adleman, and Dertouzos. The purpose of homomorphic encryption is to provide users with the capacity to carry out calculations on material that has been encrypted. In many different branches of the government, therefore, it is used in programs that depend primarily on high-security documents and information security. Through the use of homomorphic encryption, we are able to carry out the mathematical operations directly on the ciphertext, all the while protecting the secret key that is required to decipher the final product. This method also produces the same accurate results as would be obtained by doing the calculations on the plaintext.

Keywords: FHE; fully homomorphic encryption schemes; HE; homomorphic encryption; LWE; learning with errors.

DOI: 10.1504/IJCSM.2024.142728

International Journal of Computing Science and Mathematics, 2024 Vol.20 No.3, pp.228 - 242

Accepted: 01 Jul 2024
Published online: 19 Nov 2024 *

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