Next Article in Journal
Stability and Delay of NDMA-MPR Protocol in Rice-Correlated Channels with Co-Channel Interference
Next Article in Special Issue
A Novel Chip-Level Blockchain Security Solution for the Internet of Things Networks
Previous Article in Journal
Emotion Recognition from Speech Using the Bag-of-Visual Words on Audio Segment Spectrograms
Previous Article in Special Issue
On Distributed Denial of Service Current Defense Schemes
Open AccessArticle

A Verifiable Fully Homomorphic Encryption Scheme for Cloud Computing Security

CEDOC ST2I ENSIAS, Mohammed V University in Rabat; Rabat 723, Morocco
Author to whom correspondence should be addressed.
Technologies 2019, 7(1), 21;
Received: 30 December 2018 / Revised: 29 January 2019 / Accepted: 1 February 2019 / Published: 6 February 2019
(This article belongs to the Special Issue Technologies for Industry 4.0)
PDF [6028 KB, uploaded 17 February 2019]


Performing smart computations in a context of cloud computing and big data is highly appreciated today. It allows customers to fully benefit from cloud computing capacities (such as processing or storage) without losing confidentiality of sensitive data. Fully homomorphic encryption (FHE) is a smart category of encryption schemes that enables working with the data in its encrypted form. It permits us to preserve confidentiality of our sensible data and to benefit from cloud computing capabilities. While FHE is combined with verifiable computation, it offers efficient procedures for outsourcing computations over encrypted data to a remote, but non-trusted, cloud server. The resulting scheme is called Verifiable Fully Homomorphic Encryption (VFHE). Currently, it has been demonstrated by many existing schemes that the theory is feasible but the efficiency needs to be dramatically improved in order to make it usable for real applications. One subtle difficulty is how to efficiently handle the noise. This paper aims to introduce an efficient and symmetric verifiable FHE based on a new mathematic structure that is noise free. In our encryption scheme, the noise is constant and does not depend on homomorphic evaluation of ciphertexts. The homomorphy of our scheme is obtained from simple matrix operations (addition and multiplication). The running time of the multiplication operation of our encryption scheme in a cloud environment has an order of a few milliseconds. View Full-Text
Keywords: verifiable; fully homomorphic encryption; Lipschitz integers; cloud; Azure; security; smart computations verifiable; fully homomorphic encryption; Lipschitz integers; cloud; Azure; security; smart computations

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

EL-YAHYAOUI, A.; ECH-CHERIF EL KETTANI, M.D. A Verifiable Fully Homomorphic Encryption Scheme for Cloud Computing Security. Technologies 2019, 7, 21.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Technologies EISSN 2227-7080 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top