🤖 AI Summary
Traditional differential privacy relies on overly conservative worst-case assumptions about adversary knowledge, which often fail to reflect real-world privacy risks. This work investigates the composition of multiple queries under a statistical privacy framework, leveraging subsampling and random partitioning of the database to limit inter-query dependencies. Without imposing additional constraints on the database, the study establishes, for the first time, an upper bound on statistical privacy against adversaries with limited prior knowledge. By integrating information-theoretic entropy modeling, the approach enables joint analysis of privacy and utility. Under identical privacy budgets and utility loss, the proposed method supports significantly more queries than existing techniques, thereby substantially enhancing both practicality and accuracy of the privacy mechanism.
📝 Abstract
Differential Privacy (DP) considers a scenario in which an adversary has almost complete information about the entries of a database. This worst-case assumption is likely to overestimate the privacy threat faced by an individual in practice. In contrast, Statistical Privacy (SP), as well as related notions such as noiseless privacy or limited background knowledge privacy, describe a setting in which the adversary knows the distribution of the database entries, but not their exact realizations. In this case, privacy analysis must account for the interaction between uncertainty induced by the entropy of the underlying distributions and privacy mechanisms that distort query answers, which can be highly non-trivial. This paper investigates this problem for multiple queries (composition). A privacy mechanism is proposed that is based on subsampling and randomly partitioning the database to bound the dependency among queries. This way for the first time, to the best of our knowledge, upper privacy bounds against limited adversaries are obtained without any further restriction on the database. These bounds show that in realistic application scenarios taking the entropy of distributions into account yields improvements of privacy and precision guarantees. We illustrate examples where for fixed privacy parameters and utility loss SP allows significantly more queries than DP.