A tight context-aware leakage bound for general linear queries is derived under a prior probability lower bound, proven strictly tighter than differential privacy and converging to it as the bound approaches zero.
Differential privacy and the risk-utility tradeoff for multi-dimensional contingency tables
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Context-aware Privacy Bounds for Linear Queries
A tight context-aware leakage bound for general linear queries is derived under a prior probability lower bound, proven strictly tighter than differential privacy and converging to it as the bound approaches zero.