Proceedings of the 24th ACM International on Conference on Information and Knowledge Management 2015
DOI: 10.1145/2806416.2806441
|View full text |Cite
|
Sign up to set email alerts
|

Differentially Private Histogram Publication for Dynamic Datasets

Abstract: Differential privacy has recently become a de facto standard for private statistical data release. Many algorithms have been proposed to generate differentially private histograms or synthetic data. However, most of them focus on “one-time” release of a static dataset and do not adequately address the increasing need of releasing series of dynamic datasets in real time. A straightforward application of existing histogram methods on each snapshot of such dynamic datasets will incur high accumulated error due to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 44 publications
(28 citation statements)
references
References 32 publications
(48 reference statements)
0
28
0
Order By: Relevance
“…In addition, Ref. introduced an adaptive sampling approach for dynamic data sets of differentially private histogram publication. However, these methods all attempt to find a reconstruction method to improve the accuracy of the released data, ignoring outliers existing in the original histogram.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, Ref. introduced an adaptive sampling approach for dynamic data sets of differentially private histogram publication. However, these methods all attempt to find a reconstruction method to improve the accuracy of the released data, ignoring outliers existing in the original histogram.…”
Section: Related Workmentioning
confidence: 99%
“…A histogram publication mechanism Q satisfies -differential privacy ( -DP) [5] , if it outputs a ran-…”
Section: Dp (Differential Privacy)mentioning
confidence: 99%
“…We observe that U ( n , ε ) can be considered as a general utility form in a series of existing state-of-the-art DP algorithms (e.g. [11, 13, 15, 3, 4, 20, 8, 12, 18, 17]). (i) Count query In the Laplace mechanism, the noisy result of a function f can be represented as f ( D ) + ν , where ν follows Lap(italicΔfε), and Δ f is the sensitivity related to number of records n .…”
Section: Partitioning Mechanismsmentioning
confidence: 99%