Generalized per-server privacy requirement sets are defined for graph-based PIR, with capacity bounds derived for path and cyclic graphs under neighborhood-range privacy.
Download one symbol corresponding to the PIR scheme on path graph consisting ofN k, serverk−h−1and serverh+k+ 2, whenθ=k
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Private Information Retrieval With Arbitrary Privacy Requirements for Graph-Based Storage
Generalized per-server privacy requirement sets are defined for graph-based PIR, with capacity bounds derived for path and cyclic graphs under neighborhood-range privacy.