14 papers
Multi-Server Private Linear Transformation with Joint Privacy
Fatemeh Kazemi, Alex Sprintson
This paper focuses on the Private Linear Transformation (PLT) problem in the multi-server scenario. In this problem, there are servers, each of which stores an identical copy o…
Efficient Storage Schemes for Desired Service Rate Regions
Fatemeh Kazemi, Sascha Kurz, Emina Soljanin +1
A major concern in cloud/edge storage systems is serving a large number of users simultaneously. The service rate region is introduced recently as an important performance metric f…
Service Rate Region: A New Aspect of Coded Distributed System Design
Mehmet Aktas, Gauri Joshi, Swanand Kadhe +2
Erasure coding has been recognized as a powerful method to mitigate delays due to slow or straggling nodes in distributed systems. This work shows that erasure coding of data objec…
A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes
Fatemeh Kazemi, Esmaeil Karimi, Emina Soljanin +1
We propose a novel technique for constructing a graph representation of a code through which we establish a significant connection between the service rate problem and the well-kno…
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes
Fatemeh Kazemi, Sascha Kurz, Emina Soljanin
Service rate is an important, recently introduced, performance metric associated with distributed coded storage systems. Among other interpretations, it measures the number of user…
The Role of Coded Side Information in Single-Server Private Information Retrieval
Anoosheh Heidarzadeh, Fatemeh Kazemi, Alex Sprintson
We study the role of coded side information in single-server Private Information Retrieval (PIR). An instance of the single-server PIR problem includes a server that stores a datab…
Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes
Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh +2
This paper considers the problem of Quantitative Group Testing (QGT) where there are some defective items among a large population of items. We consider the scenario in which e…
Private Information Retrieval with Private Coded Side Information: The Multi-Server Case
Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh +1
In this paper, we consider the multi-server setting of Private Information Retrieval with Private Coded Side Information (PIR-PCSI) problem. In this problem, there is a database of…
Multi-Server Private Information Retrieval with Coded Side Information
Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh +1
In this paper, we study the multi-server setting of the \emph{Private Information Retrieval with Coded Side Information (PIR-CSI)} problem. In this problem, there are messages…
Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information
Anoosheh Heidarzadeh, Fatemeh Kazemi, Alex Sprintson
We study the problem of single-server single-message Private Information Retrieval with Private Coded Side Information (PIR-PCSI). In this problem, there is a server that stores a…
Single-Server Single-Message Online Private Information Retrieval with Side Information
Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh +1
In many practical settings, the user needs to retrieve information from a server in a periodic manner, over multiple rounds of communication. In this paper, we discuss the setting…
Sparse Graph Codes for Non-adaptive Quantitative Group Testing
Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh +2
This paper considers the problem of Quantitative Group Testing (QGT). Consider a set of items among which items are defective. The QGT problem is to identify (all or a suff…
Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information
Anoosheh Heidarzadeh, Fatemeh Kazemi, Alex Sprintson
This paper considers the problem of single-server single-message private information retrieval with coded side information (PIR-CSI). In this problem, there is a server storing a d…
A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring Scale
Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh +1
This paper considers a generalized version of the coin weighing problem with a spring scale that lies at the intersection of group testing and compressed sensing problems. Given a…