8 papers · 1 filter
Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
Neehar Verma, Camilla Hollanti, Razane Tajeddine
We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes. We develop a general framework for analyzing random puncturings of evaluation…
On the Extension of Private Distributed Matrix Multiplication Schemes to the Grid Partition
Christoph Hofmeister, Razane Tajeddine, Antonia Wachter-Zeh +1
We consider polynomial codes for private distributed matrix multiplication (PDMM/SDMM). Existing codes for PDMM are either specialized for the outer product partitioning (OPP), or…
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…
Private Information Retrieval Schemes with Regenerating Codes
Julien Lavauzelle, Razane Tajeddine, Ragnar Freij-Hollanti +1
A private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes…
Private Information Retrieval over Random Linear Networks
Razane Tajeddine, Antonia Wachter-Zeh, Camilla Hollanti
In this paper, the problem of providing privacy to users requesting data over a network from a distributed storage system (DSS) is considered. The DSS, which is considered as the m…
Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +2
The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered. An explicit scheme using an …