2018Unpublished venueRequires access

Dynamic Data Histogram Publishing Based on Differential Privacy

Ruichao Gao, Xuebin Ma

Open publisher page 6 citations

Abstract

Differential privacy, due to its rigorous mathematical proof and strong privacy guarantee, has become a standard for the release of statistics on privacy protection. In the process of its continuous development, many data publishing algorithms that satisfy the differential privacy histogram are proposed. However, most of these algorithms are focused on the release of static data and less research on dynamic data release. A direct way of publishing dynamic data is to publish a histogram that satisfies the differential privacy at every time point, but this method can lead to high cumulative error and reduce the utility of datasets. In order to solve these problems, we propose a histogram publishing algorithm for differential privacy dynamic data based on Kullback-Leibler(KL) divergence. The algorithm uses KL divergence to calculate the difference between two adjacent data updates. At the same time, for the different values calculated by KL divergence, we adopt three strategies for dynamic data publishing. Extensive experiments on real datasets demonstrate that our algorithm can reduce noise errors and achieves better utility than existing state-of-the-art algorithms.

About this research paper

What this paper is about

Differential privacy, due to its rigorous mathematical proof and strong privacy guarantee, has become a standard for the release of statistics on privacy protection. In the process of its continuous development, many data publishing algorithms that satisfy the differential privacy histogram are proposed. However, most of these algorithms are focused on the release of static data and less research on dynamic data release. A direct way of publishing dynamic data is to publish a histogram that satisfies the differential privacy at every time point, but this method can lead to high cumulative error and reduce the utility of datasets. In order to solve these problems, we propose a histogram publishing algorithm for differential privacy dynamic data based on Kullback-Leibler(KL) divergence. The algorithm uses KL divergence to calculate the difference between two adjacent data updates. At the same time, for the different values calculated by KL divergence, we adopt three strategies for dynamic data publishing. Extensive experiments on real datasets demonstrate that our algorithm can reduce noise errors and achieves better utility than existing state-of-the-art algorithms.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Differential privacy, due to its rigorous mathematical proof and strong privacy guarantee, has become a standard for the release of statistics on privacy protection. In the process of its continuous development, many data publishing algorithms that satisfy the differential privacy histogram are proposed. However, most of these algorithms are focused on the release of static data and less research on dynamic data release. A direct way of publishing dynamic data is to publish a histogram that satisfies the differential privacy at every time point, but this method can lead to high cumulative error and reduce the utility of datasets. In order to solve these problems, we propose a histogram publishing algorithm for differential privacy dynamic data based on Kullback-Leibler(KL) divergence. The algorithm uses KL divergence to calculate the difference between two adjacent data updates. At the same time, for the different values calculated by KL divergence, we adopt three strategies for dynamic data publishing. Extensive experiments on real datasets demonstrate that our algorithm can reduce noise errors and achieves better utility than existing state-of-the-art algorithms.

Key concepts: Differential privacy, Data publishing, Histogram, Computer science, Divergence (linguistics), Data mining, Publishing, Publication

Related papers

Back to paper searchBrowse research topicsOriginal source
Dynamic Data Histogram Publishing Based on Differential Privacy — Research Paper | ScholarLens