A multi-round protocol combining randomized response and Laplace noise gives unbiased, low-variance estimates of common-neighbor counts in bipartite graphs under edge local differential privacy.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
A multi-round protocol combining randomized response and Laplace noise gives unbiased, low-variance estimates of common-neighbor counts in bipartite graphs under edge local differential privacy.