A lower bound on the release of differentially private integer partitions.

Information Processing Letters(2018)

引用 7|浏览11
暂无评分
摘要
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 ε-differentially private mechanism releasing a partition of a sufficiently large non-negative integer N must incur a minimax risk of order Ω(N/ε). Moreover, for small values of N, we provide an optimal lower bound of order Ω(N).
更多
查看译文
关键词
Randomized algorithms,Differential privacy,Integer partitions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要