Back to Paper
cs.ITcs.CRmath.ST
Local ID: 2603.20968v2
AI Summary: gemma4:e4b
Composition Theorems for Multiple Differential Privacy Constraints
By Cemre Cadir, Salim Najib, Yanina Y. Shkel
Revision History Timeline
v13/21/2026
3/21/2026
“Pre-print of 2026 IEEE International Symposium on Information Theory (ISIT 2026), extended version”
v24/15/2026
4/15/2026
“Extended version of article in 2026 IEEE International Symposium on Information Theory (ISIT 2026)”
★ Version indexed in ExplorerComparing v1 vs v2
Green = Added • Red = Removed
Title Comparison
Composition Theorems for Multiple Differential Privacy Constraints
Authors Comparison
No author changes.
v1 Comment
“Pre-print of 2026 IEEE International Symposium on Information Theory (ISIT 2026), extended version”
v2 Comment
“Extended version of article in 2026 IEEE International Symposium on Information Theory (ISIT 2026)”
Abstract Word Diff
The exact composition of mechanisms for which two differential privacy (DP) constraints hold simultaneously is studied. The resulting privacy region admits an exact representation as a mixture over compositions of mechanisms of heterogeneous DP guarantees, yielding a framework that naturally generalizes to the composition of mechanisms for which any number of DP constraints hold. This result is shown through a structural lemma for mixtures of binary hypothesis tests. Lastly, the developed methodology is applied to approximate $f$-DP composition.