For any demand family in SPSSR, the maximum retrieval rate is 1-1/N, achieved with shared-randomness ratio D/(N-1) and subpacketization (N-1)/gcd(D,N-1) for balanced linear schemes.
The Capacity of Private Information Retrieval
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.IT 3years
2026 3verdicts
UNVERDICTED 3roles
background 2polarities
background 2representative citing papers
PCBR achieves the optimal MPIR retrieval rate with substantially lower subpacketization by restricting demands to contiguous blocks and constructing explicit balanced linear schemes.
PSSR generalizes MPIR to structured demand families, derives converse bounds on rate and subpacketization, and provides an optimization framework that recovers known MPIR schemes while improving on them for restricted demands.
citing papers explorer
-
Secure and Private Structured-Subset Retrieval: Fundamental Limits and Achievable Schemes
For any demand family in SPSSR, the maximum retrieval rate is 1-1/N, achieved with shared-randomness ratio D/(N-1) and subpacketization (N-1)/gcd(D,N-1) for balanced linear schemes.
-
Private Contiguous-Block Retrieval
PCBR achieves the optimal MPIR retrieval rate with substantially lower subpacketization by restricting demands to contiguous blocks and constructing explicit balanced linear schemes.
-
Private Structured-Subset Retrieval
PSSR generalizes MPIR to structured demand families, derives converse bounds on rate and subpacketization, and provides an optimization framework that recovers known MPIR schemes while improving on them for restricted demands.