Speeding Up Private Distributed Matrix Multiplication via Bivariate
Polynomial Codes

v1v2 (latest)

Speeding Up Private Distributed Matrix Multiplication via Bivariate Polynomial Codes

International Symposium on Information Theory (ISIT), 2021

16 February 2021

Burak Hasircioglu

J. Gómez-Vilardebó

Deniz Gunduz

ArXiv (abs)PDF HTML

Papers citing "Speeding Up Private Distributed Matrix Multiplication via Bivariate Polynomial Codes"

4 / 4 papers shown

Title
HerA Scheme: Secure Distributed Matrix Multiplication via Hermitian CodesInternational Symposium on Information Theory (ISIT), 2023 R. A. Machado Gretchen L. Matthews Welington Santos 205 20 0 29 Mar 2023
Root of Unity for Secure Distributed Matrix Multiplication: Grid Partition CaseInformation Theory Workshop (ITW), 2022 R. A. Machado Felice Manganiello 166 12 0 03 Jun 2022
Bivariate Polynomial Codes for Secure Distributed Matrix MultiplicationIEEE Journal on Selected Areas in Communications (JSAC), 2021 Burak Hasircioglu J. Gómez-Vilardebó Deniz Gunduz 222 11 0 14 Jun 2021
Coded sparse matrix computation schemes that leverage partial stragglersIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2020 A. Das A. Ramamoorthy 241 47 0 11 Dec 2020