A Verifiable Fully Homomorphic Encryption Scheme for Cloud Computing Security

• Main Authors: Ahmed EL-YAHYAOUI, Mohamed Dafir ECH-CHERIF EL KETTANI
• Format: Article
• Language: English
• Published: MDPI AG 2019-02-01
• Series: Technologies
• Subjects: verifiable; fully homomorphic encryption; Lipschitz integers; cloud; Azure; security; smart computations
• Online Access: https://www.mdpi.com/2227-7080/7/1/21

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.