Paper Info
Title
Matrix FHE and Its Application in Optimizing Bootstrapping.
Abstract
We propose a fully homomorphic encryption (FHE) scheme that encrypts matrices. Our scheme supports homomorphic matrix addition, multiplication and Hadamard product. In PKC 2015, Hiromasa et al. constructed the only FHE scheme that encrypts matrices and supports homomorphic matrix addition and multiplication. Compared with their work, the advantages of our scheme are the following: (1) Small ciphertext size: For a plaintext matrix M is an element of {0,1}(r x r), the size of ciphertext matrix is r x (n + r), in contrast to (n + r) x (n + r) [log q] in their work. (2) Standard assumption: The security is based on LWE assumption merely, while the security of scheme in their work depends additionally on some special kind of circular security assumption. (3) Supporting homomorphic matrix Hadamard product. We show how to apply the proposed scheme to optimize the bootstrapping procedure of Alperin-Sheriff and Peikert, in a way similar to the work of Hiromasa, Abe and Okamoto. Due to smaller ciphertext matrices, the bootstrapping key of our optimized bootstrapping procedure is smaller than that in the work of Hiromasa, Abe and Okamoto by a factor of (n/r + 1) [log q].
Year
DOI
Venue
2018
10.1093/comjnl/bxy088
COMPUTER JOURNAL
Keywords
Field
DocType
fully homomorphic encryption,LWE,matrix,packing,bootstrapping
Matrix (mathematics),Computer science,Bootstrapping,Theoretical computer science
Journal
Volume
Issue
ISSN
61
12
0010-4620
Citations 
PageRank 
References 
0
0.34
2
Authors
4
Name
Order
Citations
PageRank
Biao Wang18217.14
Xueqing Wang21196.45
Rui Xue31027.32
Xinyi Huang42245129.63