Weakly-Private Information Retrieval From MDS-Coded Distributed Storage

2024/01/17 by Asbjørn O. Orvedal, Orvedal, Asbjørn O., Hsuan-Yin Lin +3
Computer Science · #Cooperative Communication and Network Coding #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Privacy-Preserving Technologies in Data

paper · pdf · doi:10.48550/arxiv.2401.09412

openalex publication_date 2024/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider the problem of weakly-private information retrieval (WPIR) when data is encoded by a maximum distance separable code and stored across multiple servers. In WPIR, a user wishes to retrieve a piece of data from a set of servers without leaking too much information about which piece of data she is interested in. We study and provide the first WPIR protocols for this scenario and present results on their optimal trade-off between download rate and information leakage using the maximal leakage privacy metric.

Related

• Improved Weakly Private Information Retrieval Codes
• The Capacity of Single-Server Weakly-Private Information Retrieval
• Multi-Server Weakly-Private Information Retrieval
• On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage
• Weakly Private Information Retrieval from Heterogeneously Trusted Servers