Authors: Xu An Wang; Fatos Xhafa; Jianfeng Ma; Yunfei Cao; Dianhua Tang
Addresses: School of Telecommunications Engineering, Xidian University, Xi'an, China; Key Laboratory of Information and Network Security, Engineering University of Chinese Armed Police Force, Xi'an, China ' Department of Computer Science, Technical University of Catalonia, Barcelona, Spain ' School of Cyber Engineering, Xidian University, Shaanxi, China ' Science and Technology on Communication Security Laboratory (CETC 30), Chengdu, China ' Science and Technology on Communication Security Laboratory (CETC 30), Chengdu, China
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.
Keywords: fully homomorphic encryption; reusable garbled gates; garbled circuits; indistinguishable obfuscation; cryptography; cryptographic primitives; garbled circuit reuse.
International Journal of Web and Grid Services, 2017 Vol.13 No.1, pp.25 - 48
Available online: 27 Jan 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article