Fast secure matrix multiplications over ring-based homomorphic encryption. Issue 4 (4th July 2021)

• Record Type: Journal Article
• Authors: Mishra, Pradeep Kumar; Rathee, Deevashwer; Duong, Dung Hoang; Yasuda, Masaya
• Is Part Of: Information security journal. Volume 30:Issue 4(2021)
• Page Start: 219
• Page End: 234
• Publication Date: 2021-07-04
• Subjects: Secure matrix multiplications -- leveled fully homomorphic encryption -- packing methods; Computer security -- Periodicals; Electronic data processing departments -- Security measures -- Periodicals; 005.805
• DOI: 10.1080/19393555.2020.1836288
• Languages: English
• ISSNs: 1939-3555

Abstract

ABSTRACT: As widespread development of biometrics, concerns about security and privacy are rapidly increasing. 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) 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.