Cryptology ePrint Archive: Report 2018/1245

Multi-dimensional Packing for HEAAN for Approximate Matrix Arithmetics

Jung Hee Cheon and Andrey Kim and Donggeon Yhee

Abstract: HEAAN is a homomorphic encryption (HE) scheme for approximate arithmetics. Its vector packing technique proved its potential in cryptographic applications requiring approximate computations, including data analysis and machine learning.

In this paper, we propose MHEAAN - a generalization of HEAAN to the case of a tensor structure of plaintext slots. Our design takes advantage of the HEAAN scheme, that the precision losses during the evaluation are limited by the depth of the circuit, and it exceeds no more than one bit compared to unencrypted approximate arithmetics, such as floating point operations. Due to the multi-dimensional structure of plaintext slots along with rotations in various dimensions, MHEAAN is a more natural choice for applications involving matrices and tensors. We provide a concrete two-dimensional construction and show the efficiency of our scheme on several matrix operations, such as matrix multiplication, matrix transposition, and inverse.

As an application, we implement the non-interactive Deep Neural Network (DNN) classification algorithm on encrypted data and encrypted model. Due to our efficient bootstrapping, the implementation can be easily extended to DNN structure with an arbitrary number of hidden layers

Category / Keywords: implementation / Homomorphic encryption, approximate arithmetics, matrix operations, bootstrapping, linear transformation, encrypted deep neural network.

Date: received 21 Dec 2018, last revised 1 Jan 2019

Contact author: kimandrik at snu ac kr

Available format(s): PDF | BibTeX Citation

Version: 20190103:181535 (All versions of this report)

Short URL: ia.cr/2018/1245


[ Cryptology ePrint archive ]