5 citations · 9 across the 6 of their papers we have counts for
14 papers · 1 filter
Degree Tables for Secure Distributed Matrix Multiplication
Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein +1
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious s…
Constructing Partial MDS Codes from Reducible Curves
Tristram Bogart, Anna-Lena Horlemann-Trautmann, David Karpuk +2
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and im…
Notes on Communication and Computation in Secure Distributed Matrix Multiplication
Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein +1
We consider the problem of secure distributed matrix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers.…
Towards Practical Private Information Retrieval from MDS Array Codes
Jie Li, David Karpuk, Camilla Hollanti
Private information retrieval (PIR) is the problem of privately retrieving one out of original files from severs, i.e., each individual server learns nothing about the file…
GASP Codes for Secure Distributed Matrix Multiplication
Rafael G. L. D'Oliveira, Salim El Rouayheb, David Karpuk
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious s…
Private Polynomial Computation from Lagrange Encoding
Netanel Raviv, David A. Karpuk
Private computation is a generalization of private information retrieval, in which a user is able to compute a function on a distributed dataset without revealing the identity of t…