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.
Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
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 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.