Cryptology ePrint Archive: Report 2018/663

Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption

Pradeep Kumar Mishra and Deevashwer Rathee and Dung Hoang Duong and Masaya Yasuda

Abstract: Secure matrix computation is one of the most fundamental and useful operations for statistical analysis and machine learning with protecting the confidentiality of input data. Secure computation can be achieved by homomorphic encryption, supporting meaningful operations over encrypted data. HElib is a software library that implements the Brakerski-Gentry-Vaikuntanathan (BGV) homomorphic scheme, in which secure matrix-vector multiplication is proposed for operating matrices. Recently, Duong et al. (Tatra Mt. Publ. 2016) proposed a new method for secure single matrix multiplication over a ring-LWE-based scheme. In this paper, we generalize Duong et al.'s method for secure multiple matrix multiplications over the BGV scheme. We also implement our method using HElib and show that our method is much faster than the matrix-vector multiplication in HElib for secure matrix multiplications.

Category / Keywords: public-key cryptography / Secure matrix multiplications, Leveled fully homomorphic encryption, Packing methods.

Date: received 9 Jul 2018

Contact author: p-mishra at math kyushu-u ac jp

Available format(s): PDF | BibTeX Citation

Version: 20180710:005639 (All versions of this report)

Short URL: ia.cr/2018/663


[ Cryptology ePrint archive ]