Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption

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

Paper 2018/663

Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption

Pradeep Kumar Mishra, Deevashwer Rathee, 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: Secure matrix multiplications Leveled fully homomorphic encryption Packing methods.
Contact author(s): p-mishra @ math kyushu-u ac jp
History: 2018-07-10: received
Short URL: https://ia.cr/2018/663
License: CC BY

BibTeX

@misc{cryptoeprint:2018/663,
      author = {Pradeep Kumar Mishra and Deevashwer Rathee and Dung Hoang Duong and Masaya Yasuda},
      title = {Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/663},
      year = {2018},
      url = {https://eprint.iacr.org/2018/663}
}