3 papers
cs.IT2026
Weak Private Information Retrieval for Graph-based Storage
Shodasakshari Vidya, Chandan Anand, Prasad Krishnan
A distributed storage system with graph-based replication consists of a collection of databases and the files they contain. The databases (or servers) are represented as the vertic…
cs.IT2026
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…
cs.IT2026
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…