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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE journal on selected areas in information theory Ročník 2; číslo 1; s. 306 - 316
Hlavní autori:	Chen, Zhen, Jia, Zhuqing, Wang, Zhiying, Jafar, Syed Ali
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 01.03.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!