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.
Achieving the exactly optimal privacy-utility trade-off with low communication cost via shared randomness.IEEE Transactions on Information Theory, 70(10):7447–7462, October 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 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.