Have a personal or library account? Click to login
Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption Cover

Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption

Open Access
|Feb 2017

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.

DOI: https://doi.org/10.1515/tmmp-2016-0031 | Journal eISSN: 1338-9750 | Journal ISSN: 12103195
Language: English
Page range: 69 - 83
Submitted on: Sep 20, 2016
Published on: Feb 25, 2017
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2017 Dung Hoang Duong, Pradeep Kumar Mishra, Masaya Yasuda, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.