A one-to-one correspondence maps maximal LDP channels under the Blackwell order to vertices of a finite-dimensional polytope, making optimal privacy-utility trade-offs computable via linear programming or vertex enumeration for general problems.
Exactly optimal and communication-efficient private estimation via block designs.IEEE Journal on Selected Areas in Information Theory, 5:123–134,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Privacy-Utility Trade-Offs in LDP: Functional and Geometric Perspectives
A one-to-one correspondence maps maximal LDP channels under the Blackwell order to vertices of a finite-dimensional polytope, making optimal privacy-utility trade-offs computable via linear programming or vertex enumeration for general problems.