Paper 2018/663

Fast Secure Matrix Multiplications over Ring-Based Homomorphic Encryption

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


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.

Available format(s)
Public-key cryptography
Publication info
Preprint. MINOR revision.
Secure matrix multiplicationsLeveled fully homomorphic encryptionPacking methods.
Contact author(s)
p-mishra @ math kyushu-u ac jp
2018-07-10: received
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.