Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption

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...

Full description

Saved in:
Bibliographic Details
Published inTatra Mountains mathematical publications Vol. 67; no. 1; pp. 69 - 83
Main Authors Duong, Dung Hoang, Mishra, Pradeep Kumar, Yasuda, Masaya
Format Journal Article
LanguageEnglish
Published De Gruyter Open 01.09.2016
Subjects
94A60
packing methods
secure inner product
secure matrix multiplication
somewhat homomorphic encryption
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1210-3195
1210-3195
DOI:10.1515/tmmp-2016-0031