Local PIR capacity on graphs shows multiplicative gains for disjoint unions of distinct graphs and exact values for cyclic graphs and odd-vertex paths, with improved lower bounds for edge-transitive and bipartite graphs over standard PIR.
Title resolution pending
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
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.
citing papers explorer
-
Local Private Information Retrieval: A New Privacy Perspective for Graph-Based Replicated Systems
Local PIR capacity on graphs shows multiplicative gains for disjoint unions of distinct graphs and exact values for cyclic graphs and odd-vertex paths, with improved lower bounds for edge-transitive and bipartite graphs over standard PIR.
-
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.