Differential privacy histogram publishing method based on dynamic sliding window
Qian CHEN , Zhiwei NI , Xuhui ZHU , Pingfan XIA
Front. Comput. Sci. ›› 2023, Vol. 17 ›› Issue (4) : 174809
Differential privacy histogram publishing method based on dynamic sliding window
Differential privacy has recently become a widely recognized strict privacy protection model of data release. Differential privacy histogram publishing can directly show the statistical data distribution under the premise of ensuring user privacy for data query, sharing, and analysis. The dynamic data release is a study with a wide range of current industry needs. However, the amount of data varies considerably over different periods. Unreasonable data processing will result in the risk of users’ information leakage and unavailability of the data. Therefore, we designed a differential privacy histogram publishing method based on the dynamic sliding window of LSTM (DPHP-DL), which can improve data availability on the premise of guaranteeing data privacy. DPHP-DL is integrated by DSW-LSTM and DPHK+. DSW-LSTM updates the size of sliding windows based on data value prediction via long short-term memory (LSTM) networks, which evenly divides the data stream into several windows. DPHK+ heuristically publishes non-isometric histograms based on k-mean++ clustering of automatically obtaining the optimal , so as to achieve differential privacy histogram publishing of dynamic data. Extensive experiments on real-world dynamic datasets demonstrate the superior performance of the DPHP-DL.
differential privacy / dynamic data / histogram publishing / sliding window
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
Dwork C, Naor M, Pitassi T, Rothblum G N. Differential privacy under continual observation. In: Proceedings of the 42nd ACM Symposium on Theory of Computing. 2010, 715–724 |
| [6] |
|
| [7] |
Xu J, Zhang Z, Xiao X, Yang Y, Yu G. Differentially private histogram publication. In: Proceedings of the 28th IEEE International Conference on Data Engineering. 2012, 32–43 |
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
Arthur D, Vassilvitskii S. k-means++: the advantages of careful seeding. In: Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms. 2007, 1027–1035 |
Higher Education Press
Supplementary files
/
| 〈 |
|
〉 |