Answering Range Queries Under Local Differential Privacy

被引:68
作者
Cormode, Graham [1 ]
Kulkarni, Tejas [1 ]
Srivastava, Divesh [2 ]
机构
[1] Univ Warwick, Coventry, W Midlands, England
[2] AT&T Labs Res, Florham Pk, NJ USA
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2019年 / 12卷 / 10期
基金
英国工程与自然科学研究理事会; 欧洲研究理事会;
关键词
D O I
10.14778/3339490.3339496
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Counting the fraction of a population having an input within a specified interval i.e. a range query, is a fundamental data analysis primitive. Range queries can also be used to compute other core statistics such as quantiles, and to build prediction models. However, frequently the data is subject to privacy concerns when it is drawn from individuals, and relates for example to their financial, health, religious or political status. In this paper, we introduce and analyze methods to support range queries under the local variant of differential privacy [23], an emerging standard for privacy-preserving data analysis. The local model requires that each user releases a noisy view of her private data under a privacy guarantee. While many works address the problem of range queries in the trusted aggregator setting, this problem has not been addressed specifically under untrusted aggregation (local DP) model even though many primitives have been developed recently for estimating a discrete distribution. We describe and analyze two classes of approaches for range queries, based on hierarchical histograms and the Haar wavelet transform. We show that both have strong theoretical accuracy guarantees on variance. In practice, both methods are fast and require minimal computation and communication resources. Our experiments show that the wavelet approach is most accurate in high privacy settings, while the hierarchical approach dominates for weaker privacy requirements.
引用
收藏
页码:1126 / 1138
页数:13
相关论文
共 35 条
  • [1] [Anonymous], 2014, ACM CCS
  • [2] [Anonymous], 2014, FDN TRENDS THEORETIC
  • [3] [Anonymous], 2016, CoRR
  • [4] [Anonymous], 2017, NIPS
  • [5] [Anonymous], 2006, THEOR CRYPT C
  • [6] [Anonymous], 2013, FOCS
  • [7] [Anonymous], 2011, SIGKDD
  • [8] [Anonymous], 2004, P INT C MACH LEARN, DOI DOI 10.1145/1015330.1015366
  • [9] Local, Private, Efficient Protocols for Succinct Histograms
    Bassily, Raef
    Smith, Adam
    [J]. STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 127 - 135
  • [10] Chang J. C.-N., 2018, IEEE SEC PRIV S