258 citations · 326 across the 32 of their papers we have counts for
39 papers
Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes
Okko Makkonen, David Karpuk, Camilla Hollanti
Private information retrieval (PIR) considers the problem of retrieving a data item from a database or distributed storage system without disclosing any information about which dat…
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
Okko Makkonen, David Karpuk, Camilla Hollanti
A new framework for interference alignment in secure and private information retrieval (PIR) from colluding servers is proposed, generalizing the original cross-subspace alignment…
Secure Distributed Matrix Multiplication with Precomputation
Ryann Cartor, Rafael G. L. D'Oliveira, Salim El Rouayheb +3
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.…
Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication
David Karpuk, Razane Tajeddine
We present Modular Polynomial (MP) Codes for Secure Distributed Matrix Multiplication (SDMM). The construction is based on the observation that one can decode certain proper subset…
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…