Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption-Reference-Cited by-同舟云学术

Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption

Published:2016-09-01 Issue:1 Volume:67 Page:69-83
ISSN:1210-3195
Container-title:Tatra Mountains Mathematical Publications
language:en
Short-container-title:

Author:

Duong Dung Hoang¹,Mishra Pradeep Kumar¹,Yasuda Masaya¹

Affiliation:

1. Institute of Mathematics for Industry and Graduate School of Mathematics, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka 819-0395, Japan

Abstract

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.

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Reference10 articles.

1. [1] BONEH, D.—GOH, E.—NISSIM, K.: Evaluating 2-DNF formulas on ciphertexts, in: Theory of Cryptography—TCC ’05, Lecture Notes in Comput. Sci., Vol. 3378, Springer-Verlag, Berlin, 2005, pp. 325–341.

2. [2] BRAKERSKI, A., LANGLOIS, A., PEIKERT, C.—REGEV, O.—STEHLÉ, D.: Classical hardness of learning with errors, in: Symposium on Theory of Computing—STOC ’13, ACM New York, NY, USA, 2013, pp. 575–584.

3. [3] BRAKERSKI, A.—VAIKUNTANATHAN, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages, in: Advances in cryptology–CRYPTO ’11, (P. Rogaway, ed.), Lecture Notes in Comput. Sci., Vol. 6841, Springer, Heidelberg, 2011. pp. 505–524.

4. [4] GENTRY, C.: Fully homomorphic encryption using ideal lattices, in: Proceedings of the 41th Symposium on Theory of Computing—STOC ’09, ACM New York, NY, USA, 2009, pp. 169–178.

5. [5] LAUTER, K.—NAEHRIG, M.—VAIKUNTANATHAN, V.: Can homomorphic encryption be practical ?, in: Proceedings of the 3rd ACM workshop on Cloud computing security workshop—CCSW ’11, ACM New York, NY, USA, 2011, pp. 113–124.

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication;The Journal of Supercomputing;2024-08-26

2. Secure and efficient general matrix multiplication on cloud using homomorphic encryption;The Journal of Supercomputing;2024-08-26

3. Secure and Efficient General Matrix Multiplication On Cloud Using Homomorphic Encryption;2024-06-11

4. Improved privacy-preserving PCA using optimized homomorphic matrix multiplication;Computers & Security;2024-03

5. Secure Outsourced Matrix Multiplication with Fully Homomorphic Encryption;Lecture Notes in Computer Science;2024