Efficient Secure Matrix Multiplication over LWE-Based Homomorphic Encryption

Dung Hoang Duong, Pradeep Kumar Mishra, Masaya Yasuda

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

Homomorphic encryption enables various calculations while preserving the data confidentiality. In this paper, we apply the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure matrix multiplication between two matrices. To reduce both the ciphertext size and the computation cost, we propose a new method to pack a matrix into a single ciphertexts so that it also enables efficient matrix multiplication over the packed ciphertexts. Our packing method generalizes Yasuda et al.'s methods (Security Comm. Networks 2015 and ACISP 2015), which are for secure inner product. We also implement our methods and give a comparison with previous packing methods.

Original languageEnglish
Pages (from-to)69-83
Number of pages15
JournalTatra Mountains Mathematical Publications
Volume67
Issue number1
DOIs
Publication statusPublished - Sep 1 2016

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Efficient Secure Matrix Multiplication over LWE-Based Homomorphic Encryption'. Together they form a unique fingerprint.

Cite this