139 citations · 423 across the 23 of their papers we have counts for
23 papers · 1 filter
The Right to Be Forgotten under Correlation: Privacy-Utility Tradeoffs
Luis Massny, Rawad Bitar, Fangwei Ye +1
We study privacy-preserving algorithms that redact information from a correlated dataset. The goal is to reduce the information leakage about sensitive parts. We analytically chara…
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…
Intermittent Private Information Retrieval with Application to Location Privacy
Fangwei Ye, Salim El Rouayheb
We study the problem of intermittent private information retrieval with multiple servers, in which a user consecutively requests one of K messages from N replicated databases such…
ON-OFF Privacy Against Correlation Over Time
Fangwei Ye, Carolina Naim, Salim El Rouayheb
We consider the problem of ON-OFF privacy in which a user is interested in the latest message generated by one of n sources available at a server. The user has the choice to turn p…
Mechanisms for Hiding Sensitive Genotypes with Information-Theoretic Privacy
Fangwei Ye, Hyunghoon Cho, Salim El Rouayheb
Motivated by the growing availability of personal genomics services, we study an information-theoretic privacy problem that arises when sharing genomic data: a user wants to share…
ON-OFF Privacy in the Presence of Correlation
Fangwei Ye, Carolina Naim, Salim El Rouayheb
We formulate and study the problem of ON-OFF privacy. ON-OFF privacy algorithms enable a user to continuously switch his privacy between ON and OFF. An obvious example is the incog…
One-Shot PIR: Refinement and Lifting
Rafael G. L. D'Oliveira, Salim El Rouayheb
We study a class of private information retrieval (PIR) methods that we call one-shot schemes. The intuition behind one-shot schemes is the following. The user's query is regarded…
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
Rawad Bitar, Parimal Parag, Salim El Rouayheb
We consider the setting of a Master server, M, who possesses confidential data (e.g., personal, genomic or medical data) and wants to run intensive computations on it, as part of a…
Codes for Correcting Localized Deletions
Serge Kas Hanna, Salim El Rouayheb
We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we s…
Private Information Retrieval with Side Information
Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh +2
We study the problem of Private Information Retrieval (PIR) in the presence of prior side information. The problem setup includes a database of independent messages possibly re…
Codes with Locality in the Rank and Subspace Metrics
Swanand Kadhe, Salim El Rouayheb, Iwan Duursma +1
We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with locality constraints in…
Guess & Check Codes for Deletions, Insertions, and Synchronization
Serge Kas Hanna, Salim El Rouayheb
We consider the problem of constructing codes that can correct deletions occurring in an arbitrary binary string of length bits. Varshamov-Tenengolts (VT) codes, dating bac…
Minimizing Latency for Secure Distributed Computing
Rawad Bitar, Parimal Parag, Salim El Rouayheb
We consider the setting of a master server who possesses confidential data (genomic, medical data, etc.) and wants to run intensive computations on it, as part of a machine learnin…
Guess & Check Codes for Deletions and Synchronization
Serge Kas Hanna, Salim El Rouayheb
We consider the problem of constructing codes that can correct deletions occurring in an arbitrary binary string of length bits. Varshamov-Tenengolts (VT) codes can correct…
Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +3
In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid…
Private Information Retrieval from MDS Coded Data in Distributed Storage Systems
Razan Tajeddine, Oliver W. Gnilke, Salim El Rouayheb
The problem of providing privacy, in the private information retrieval (PIR) sense, to users requesting data from a distributed storage system (DSS), is considered. The DSS is code…
Staircase Codes for Secret Sharing with Optimal Communication and Read Overheads
Rawad Bitar, Salim El Rouayheb
We study the communication efficient secret sharing (CESS) problem introduced by Huang, Langberg, Kliewer and Bruck. A classical threshold secret sharing scheme randomly encodes a…
Synchronizing Edits in Distributed Storage Networks
Salim El Rouayheb, Sreechakra Goparaju, Han Mao Kiah +1
We consider the problem of synchronizing data in distributed storage networks under an edit model that includes deletions and insertions. We present two modifications of MDS, regen…
New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems
Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank
We study the exact-repair tradeoff between storage and repair bandwidth in distributed storage systems (DSS). We give new inner bounds for the tradeoff region and provide code cons…
Data Exchange Problem with Helpers
Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2
In this paper we construct a deterministic polynomial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only…
Optimal Deterministic Polynomial-Time Data Exchange for Omniscience
Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2
We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a co…
Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks
Sameer Pawar, Salim El Rouayheb, Kannan Ramchandran
We address the problem of securing distributed storage systems against eavesdropping and adversarial attacks. An important aspect of these systems is node failures over time, neces…
On Secure Distributed Data Storage Under Repair Dynamics
Sameer Pawar, Salim El Rouayheb, Kannan Ramchandran
We address the problem of securing distributed storage systems against passive eavesdroppers that can observe a limited number of storage nodes. An important aspect of these system…