activity
20152026
most citedMinimizing Latency for Secure Distributed Computing

77 citations · 179 across the 54 of their papers we have counts for

collaborators
Showing 2026 · cs.ITShow all

5 papers · 2 filters

cs.IT2026

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…

cs.IT2026

CSS Quantum LRCs with Intersecting Recovery Sets: Constructions and Bounds

Evagoras Stylianou, Vinayak Ramkumar, Holger Boche +1

In this work, we study quantum locally recoverable codes (qLRCs) with locality , recovery sets per qudit, and intersection parameter . We first show that, assum…

cs.IT2026

Random Access Expectation in DNA Storage and Fountain Codes

Christoph Hofmeister, Rawad Bitar, Eitan Yaakobi

Motivated by DNA data storage, we study the expected number of coded symbols drawn from a linear code until a desired information symbol can be decoded - the random access expectat…

cs.IT2026

Coding Schemes for Document Exchange under Multiple Substring Edits

Hrishi Narayanan, Vinayak Ramkumar, Rawad Bitar +1

We study the document exchange problem under multiple substring edits. A substring edit in a string occurs when a substring of is replaced by…

cs.IT2026

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…