Fully Homomorphic Encryption Without Noise

Fully Homomorphic Encryption Without Noise

Yacine Ichibane (Ecole Mohammadia d'Ingénieurs, Mohammed V University of Rabat, Rabat, Morocco), Youssef Gahi (Ibn Tofail University, Kenitra, Morocco), Mouhcine Guennoun (Cisco Systems, Ontario, Canada) and Zouhair Guennoun (Ecole Mohammadia d'Ingénieurs, Mohammed V University of Rabat, Rabat, Morocco)
Copyright: © 2019 |Pages: 19
DOI: 10.4018/IJSST.2019070102

Abstract

In this paper, the authors present a novel fully homomorphic encryption scheme operating between and capable of arbitrarily performing additions and multiplications. The new scheme is compact and each operation (addition or multiplication) performed on any two ciphertexts produces a fresh ciphertext without any associated noise. Thus, the scheme does not need any bootstrapping procedure or noise reduction technique to refresh ciphertexts. In the absence, to the best of the knowledge of the authors, of any existing fully, partially or leveled homomorphic encryption scheme using as the set of plaintexts, the new cryptosystem has been implemented and has had its performance compared to the identity encoding.
Article Preview
Top

Background

In this section, the authors present some of the works that addressed the subject of homomorphic encryption.

Complete Article List

Search this Journal:
Reset
Open Access Articles
Volume 8: 2 Issues (2021): Forthcoming, Available for Pre-Order
Volume 7: 2 Issues (2020): 1 Released, 1 Forthcoming
Volume 6: 2 Issues (2019)
View Complete Journal Contents Listing