vix.ing · top · new · best · stats

The Composition Theorem for Differential Privacy

2013/11/04 by Peter Kairouz, Sewoong Oh, Kairouz, Peter +3 · 53 citations
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.CR #cs.DS #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1311.0776

32 pages 4 figures, Added a new section on private multi-party computation

arxiv created 2015/12/06 · arxiv updated 2015/12/08

Abstract

Sequential querying of differentially private mechanisms degrades the overall privacy level. In this paper, we answer the fundamental question of characterizing the level of overall privacy degradation as a function of the number of queries and the privacy levels maintained by each privatization mechanism. Our solution is complete: we prove an upper bound on the overall privacy level and construct a sequence of privatization mechanisms that achieves this bound. The key innovation is the introduction of an operational interpretation of differential privacy (involving hypothesis testing) and the use of new data processing inequalities. Our result improves over the state-of-the-art, and has immediate applications in several problems studied in the literature including differentially private multi-party computation.

Cited by

Related