Reusable garbled gates for new fully homomorphic encryption service. (2017)

• Record Type: Journal Article
• Authors: Wang, Xu An; Xhafa, Fatos; Ma, Jianfeng; Cao, Yunfei; Tang, Dianhua
• Is Part Of: International journal of web and grid services. Volume 13:Number 1(2017)
• Page Start: 25
• Page End: 48
• Publication Date: 2017
• Subjects: fully homomorphic encryption -- reusable garbled gates -- garbled circuits -- indistinguishable obfuscation -- cryptography -- cryptographic primitives -- garbled circuit reuse; Web services -- Periodicals; Computational grids (Computer systems) -- Periodicals; 006.78
• Languages: English
• ISSNs: 1741-1106

Abstract

In this paper, we propose a novel way to provide a fully homomorphic encryption service, namely by using garbled circuits. From a high level perspective, garbled circuits and fully homomorphic encryption, both aim at implementing complex computation on ciphertexts. We define a new cryptographic primitive named reusable garbled gate, which comes from the area of garbled circuits, then based on this new primitive we show that it is very easy to construct a fully homomorphic encryption. However, the instantiation of reusable garbled gates is rather difficult, in fact, we can only instantiate this new primitive based on indistinguishable obfuscation. Furthermore, reusable garbled gates can be a core component for constructing the reusable garbled circuits, which can reduce the communication complexity of them from O(n) to O(1). We believe that reusable garbled gates promise a new way to provide fully homomorphic encryption and reusable garbled circuits service fast.