Paper 2023/1649
A New Framework for Fast Homomorphic Matrix Multiplication
Abstract
Homomorphic Encryption (HE) is one of the mainstream cryptographic tools used to enable secure outsourced computation. A typical task is secure matrix computation. Popular HE schemes are all based on the problem of Ring Learning with Errors (RLWE), where the messages are encrypted in a ring. In general, the ring dimension should be large to ensure security, which is often larger than the matrix size. Hence, exploiting the ring structure to make fast homomorphic matrix computation has been an important topic in HE.
In this paper, we present a new framework for encoding a matrix and performing multiplication on encrypted matrices. The new framework requires fewer basic homomorphic operations for matrix multiplication. Suppose that the ring dimension is
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Preprint.
- Keywords
- Homomorphic EncryptionSecure Outsourced Matrix MultiplicationTensor RingLattice Basis and Dual Basis
- Contact author(s)
-
zhengxiaopeng @ amss ac cn
hli @ mmrc iss ac cn
dwang @ mmrc iss ac cn - History
- 2023-10-26: approved
- 2023-10-25: received
- See all versions
- Short URL
- https://ia.cr/2023/1649
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1649, author = {Xiaopeng Zheng and Hongbo Li and Dingkang Wang}, title = {A New Framework for Fast Homomorphic Matrix Multiplication}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1649}, year = {2023}, url = {https://eprint.iacr.org/2023/1649} }