Cryptology ePrint Archive: Report 2017/387

Homomorphically Encrypted Arithmetic Operations over the Integer Ring

Chen Xu and Jingwei Chen and Wenyuan Wu and Yong Feng

Abstract: Fully homomorphic encryption allows cloud servers to evaluate any computable functions for clients without revealing any information. It attracts much attention from both of the scientific community and the industry since Gentry’s seminal scheme. Currently, the Brakerski- Gentry-Vaikuntanathan scheme with its optimizations is one of the most potentially practical schemes and has been implemented in a homomorphic encryption C++ library HElib. HElib supplies friendly interfaces for arithmetic operations of polynomials over finite fields. Based on HElib, Chen and Gong (2015) implemented arithmetic over encrypted integers. In this paper, we revisit the HElib-based implementation of homomorphically arithmetic operations on encrypted integers. Due to several optimizations and more suitable arithmetic circuits for homomorphic encryption evaluation, our implementation is able to homomorphically evaluate 64-bit addition/subtraction and 16-bit multiplication for encrypted integers without bootstrapping. Experiments show that our implementation outperforms Chen and Gong’s significantly.

Category / Keywords: FHE, HElib, Encrypted integer arithmetic

Original Publication (in the same form): ISPEC 2016
DOI:
10.1007/978-3-319-49151-6_12

Date: received 3 May 2017

Contact author: jingwei chen at outlook com

Available format(s): PDF | BibTeX Citation

Version: 20170504:120143 (All versions of this report)

Short URL: ia.cr/2017/387

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]