139 citations · 423 across the 23 of their papers we have counts for
30 papers
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…
RW-LoRA: Communication-Efficient Decentralized LoRA Fine-Tuning via Random Walks
Xingran Chen, Rohit Bhagat, Ghadir Ayache +3
Parameter-efficient fine-tuning methods such as LoRA have become a standard approach for adapting large foundation models. Adopting fine-tuning to distributed settings faces severa…
Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks
Xingran Chen, Parimal Parag, Rohit Bhagat +1
Random walk (RW)-based algorithms have long been popular in distributed systems due to low overheads and scalability, with recent growing applications in decentralized learning. Ho…
Random Walk Learning and the Pac-Man Attack
Xingran Chen, Parimal Parag, Rohit Bhagat +2
Random walk (RW)-based algorithms have long been popular in distributed systems due to low overheads and scalability, with recent growing applications in decentralized learning. Ho…
The Entrapment Problem in Random Walk Decentralized Learning
Zonghong Liu, Salim El Rouayheb, Matthew Dwyer
This paper explores decentralized learning in a graph-based setting, where data is distributed across nodes. We investigate a decentralized SGD algorithm that utilizes a random wal…
Adaptive Stochastic Gradient Descent for Fast and Communication-Efficient Distributed Learning
Serge Kas Hanna, Rawad Bitar, Parimal Parag +2
We consider the setting where a master wants to run a distributed stochastic gradient descent (SGD) algorithm on workers, each having a subset of the data. Distributed SGD may…
DSAG: A mixed synchronous-asynchronous iterative method for straggler-resilient learning
Albin Severinson, Eirik Rosnes, Salim El Rouayheb +1
We consider straggler-resilient learning. In many previous works, e.g., in the coded computing literature, straggling is modeled as random delays that are independent and identical…
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…
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers
Serge Kas Hanna, Rawad Bitar, Parimal Parag +2
We consider the setting where a master wants to run a distributed stochastic gradient descent (SGD) algorithm on workers each having a subset of the data. Distributed SGD may s…
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…