9 papers
Converse Bounds for Sun-Jafar-type Weak Private Information Retrieval
Chandan Anand, Jayesh Seshadri, Prasad Krishnan +1
Building on the well-established capacity-achieving schemes of Sun-Jafar (for replicated storage) and the closely related scheme of Banawan-Ulukus (for MDS-coded setting), a recent…
Extreme Points of the -LDP Polytope with Small Input Size and Arbitrary Output Sizes
Supriya Rawat, Myna Vajha, Gowtham R. Kurri +1
The structure of locally differentially private (LDP) mechanisms can be understood through the geometry of the corresponding privacy polytope. While the extreme points of the \( (Î…
Secure Distributed Hypothesis Testing
Gowtham R. Kurri, Varun Narayanan, Vinod M. Prabhakaran +1
In distributed hypothesis testing, a central server performs hypothesis testing based on information received from distributed sensors/clients. We study a secure variant of this pr…
From Submodularity to Matrix Determinants: Strengthening Han's, Szász's, and Fischer's Inequalities
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
Dembo, Cover, and Thomas (1991) developed an elegant information-theoretic framework for proving determinantal inequalities for positive definite matrices, which relies on the stru…
On the Optimal Message Size in PIR Under Arbitrary Collusion Patterns
Guru S. Dornadula, Manikya Pant, Gowtham R. Kurri +1
A private information retrieval protocol (PIR) scheme under an arbitrary collusion pattern enables a client to retrieve one message from a library of equal-sized…
Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
It is well known that there is a strong connection between entropy inequalities and submodularity, since the entropy of a collection of random variables is a submodular function. U…