Private Information Retrieval With Arbitrary Privacy Requirements: Introduction and Capacity Results

arXiv:2609.15875 · cs.IT, cs.CR, cs.NI, eess.SP, math.IT · Submitted 2026-09-14 · Read on arXiv

cs.IT, cs.CR, cs.NI, eess.SP, math.IT

Submitted: 2026-09-14

Updated: 2026-09-14

Comments: Abstract is trimmed for space limitations

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Decode — 5× in this paper · explained in 2 episodes
• Abundance — 3× in this paper · explained in 1 episode
• Generalization — 3× in this paper · explained in 13 episodes
• Alignment — 2× in this paper · explained in 1 episode
• Hypergraph — 2× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes

Sources

• The Role of Common Randomness Replication in Symmetric PIR on Graph-Based Replicated Systems
• Private Information Retrieval over Graphs
• Private Information Retrieval for Graph-based Replication with Minimal Subpacketization
• Local Private Information Retrieval: A New Privacy Perspective for Graph-Based Replicated Systems
• Local Private Information Retrieval for Graph-Based Replicated Systems

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions