2025/01/20 by Anand, Chandan, Jayesh Seshadri, Seshadri, Jayesh +3
Computer Science · #Cryptography and Data Security #Privacy-Preserving Technologies in Data #Complexity and Algorithms in Graphs
paper · pdf · doi:10.48550/arxiv.2501.11505
In information-theoretic private information retrieval (PIR), a client wants to retrieve one desired file out of M files, stored across N servers, while keeping the index of the desired file private from each T-sized subset of servers. A PIR protocol must ideally maximize the rate, which is the ratio of the file size to the total quantum of the download from the servers, while ensuring such privacy. In Weak-PIR (WPIR), the criterion of perfect information-theoretic privacy is relaxed. This enables higher rates to be achieved, while some information about the desired file index leaks to the servers. This leakage is captured by various known privacy metrics. By leveraging the well-established capacity-achieving schemes of Sun and Jafar under non-colluding (T=1) and colluding (1