6 papers
Universally optimal (wiretap) codes
Madhura Pathegama, Alexander Barg
Universally optimal (UO) codes were introduced by H. Cohn and A. Kumar in 2007 and later extended to the discrete setting by Cohn and Y. Zhao. They minimize the ``energy'' among al…
Local Differential Privacy with Correlated Noise Achieves Central-DP Optimal Cost
Madhura Pathegama, Srikanth Avasarala, Viveck R. Cadambe +1
We study privately estimating the sum of user-held values in the presence of an honest-but-curious server. This motivates requiring privacy not only at data release but also th…
Rényi divergence-based uniformity guarantees for -universal hash functions
Madhura Pathegama, Alexander Barg
Universal hash functions map the output of a source to random strings over a finite alphabet, aiming to approximate the uniform distribution on the set of strings. A classic result…
Rényi divergence guarantees for hashing with linear codes
Madhura Pathegama, Alexander Barg
We consider the problem of distilling uniform random bits from an unknown source with a given -entropy using linear hashing. As our main result, we estimate the expected -div…
Limitations of the decoding-to-LPN reduction via code smoothing
Madhura Pathegama, Alexander Barg
The Learning Parity with Noise (LPN) problem underlines several classic cryptographic primitives. Researchers have attempted to demonstrate the algorithmic hardness of this problem…
Regular LDPC codes on BMS wiretap channels: Security bounds
Madhura Pathegama, Alexander Barg
We improve the secrecy guarantees for transmission over general binary memoryless symmetric wiretap channels that relies on regular LDPC codes. Previous works showed that LDPC code…