A lower bound on the release of differentially private integer partitions

被引:5
作者
Alda, Francesco [1 ]
Simon, Hans Ulrich
机构
[1] Ruhr Univ Bochum, Horst Gortz Inst IT Secur, Univ Str 150, D-44801 Bochum, Germany
关键词
Randomized algorithms; Differential privacy; Integer partitions;
D O I
10.1016/j.ipl.2017.09.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of privately releasing integer partitions. This problem is of high practical interest, being related to the publication of password frequency lists or the degree distribution of social networks. In this work, we show that any epsilon-differentially private mechanism releasing a partition of a sufficiently large non-negative integer N must incur a minimax risk of order Omega(root N/epsilon). Moreover, for small values of N, we provide an optithal lower bound of order Omega(N). (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 4
页数:4
相关论文
共 15 条
[1]  
[Anonymous], 2016, DIFFERENTIALLY PRIVA
[2]  
[Anonymous], P 23 ANN NETW DISTR
[3]  
Assouad B. Yu., 1997, Festschrift for Lucien Le Cam, P423
[4]  
ASSOUAD P, 1983, CR ACAD SCI I-MATH, V296, P1021
[5]   The science of guessing: analyzing an anonymized corpus of 70 million passwords [J].
Bonneau, Joseph .
2012 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2012, :538-552
[6]  
Devroye L, 1987, Progress in Probability and Statistics
[7]   Local Privacy and Statistical Minimax Rates [J].
Duchi, John C. ;
Jordan, Michael I. ;
Wainwright, Martin J. .
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, :429-438
[8]   Calibrating noise to sensitivity in private data analysis [J].
Dwork, Cynthia ;
McSherry, Frank ;
Nissim, Kobbi ;
Smith, Adam .
THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 :265-284
[9]  
Hall R., 2012, Journal of Privacy and Confidentiality, V4, P43
[10]  
Hardt M, 2010, ACM S THEORY COMPUT, P705