GCSA Codes With Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication

A secure multi-party batch matrix multiplication problem (SMBMM) is considered, where the goal is to allow a master to efficiently compute the pairwise products of two batches of massive matrices, by distributing the computation across S servers. Any X colluding servers gain no information about the...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE journal on selected areas in information theory Vol. 2; no. 1; pp. 306 - 316
Main Authors:	Chen, Zhen, Jia, Zhuqing, Wang, Zhiying, Jafar, Syed Ali
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.03.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Alignment Batch processing coded computing Distributed computing Encoding Information retrieval Interference Matrices (mathematics) matrix multiplication Multiplication Network topologies Network topology Noise noise alignment Polynomials Privacy secure multi-party computation Servers Subspaces
ISSN:	2641-8770, 2641-8770
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!