Fully homomorphic encryption: a general framework and implementations. Issue 5 (2nd September 2020)

• Record Type: Journal Article
• Authors: Akl, Selim G.; Assem, Ibrahim
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 35:Issue 5(2020)
• Page Start: 493
• Page End: 498
• Publication Date: 2020-09-02
• Subjects: cloud computing -- cloud security -- database security -- cyber security -- fully homomorphic encryption -- modular arithmetic -- ring homomorphism -- commutative ring -- Euclidean domain -- integer encryption -- polynomial encryption; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2018.1553041
• Languages: English
• ISSNs: 1744-5760

Abstract

ABSTRACT: Two data items a and b are stored on an untrusted database in their encrypted forms E ( a ) and E ( b ), respectively. It is required that the encryption function be fully homomorphic, that is, E must satisfy the conditions E ( a ) + E ( b ) = E ( a + b ) and E ( a ) × E ( b ) = E ( a × b ) . This would allow the owner of the data, as well as an untrusted party operating the database on behalf of the owner, to perform operations directly on the encrypted data without the need for decryption. We propose a general framework that allows the derivation of such fully homomorphic functions. Two implementations of the general framework are then described that, in addition to being secure, enjoy the property of being efficient to compute.