TY - JOUR
T1 - Online streaming sampling publication method over sliding windows with differential privacy
AU - Wang, Xiujun
AU - Mo, Lei
AU - Guo, Longkun
AU - Lu, Zhigang
AU - Liu, Zhi
AU - Xue, Minhui
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - The widespread adoption of 5 G networks and mobile devices has led to a surge in the generation of private data, creating massive data streams. Securing and continuously releasing histogram data over sliding windows in these streams has become a critical issue, as it enables understanding recent collective phenomena in data streams while preserving individual privacy. Existing state-of-the-art methods require buffering all data from each sliding window to reconstruct accurate histograms, which is unnecessary and significantly hampers efficiency. This paper proposes an online streaming sampling publication framework with differential privacy, named the Publishing Approach with Sliding window estimation-count sketch (PAS), which constructs an approximate histogram without buffering each sliding window and subsequently generates publishable histograms. Specifically, we introduce a novel memory-efficient sketch structure called the Sliding Window Estimation-Count Sketch (SES), which facilitates rapid retrieval of counts within sliding window intervals while providing guaranteed data protection. The output of this sketch structure approximates true counts while theoretically incorporating differentially private noise, thus ensuring (ϵ, δ)-differential privacy. Moreover, to improve the speed of histogram generation and reduce processing time in PAS, we propose an adaptive histogram generation algorithm based on SES. Extensive experiments are conducted to demonstrate the effectiveness of the proposed methods in comparison with other publication methods.
AB - The widespread adoption of 5 G networks and mobile devices has led to a surge in the generation of private data, creating massive data streams. Securing and continuously releasing histogram data over sliding windows in these streams has become a critical issue, as it enables understanding recent collective phenomena in data streams while preserving individual privacy. Existing state-of-the-art methods require buffering all data from each sliding window to reconstruct accurate histograms, which is unnecessary and significantly hampers efficiency. This paper proposes an online streaming sampling publication framework with differential privacy, named the Publishing Approach with Sliding window estimation-count sketch (PAS), which constructs an approximate histogram without buffering each sliding window and subsequently generates publishable histograms. Specifically, we introduce a novel memory-efficient sketch structure called the Sliding Window Estimation-Count Sketch (SES), which facilitates rapid retrieval of counts within sliding window intervals while providing guaranteed data protection. The output of this sketch structure approximates true counts while theoretically incorporating differentially private noise, thus ensuring (ϵ, δ)-differential privacy. Moreover, to improve the speed of histogram generation and reduce processing time in PAS, we propose an adaptive histogram generation algorithm based on SES. Extensive experiments are conducted to demonstrate the effectiveness of the proposed methods in comparison with other publication methods.
KW - Data histogram
KW - data sampling
KW - data stream
KW - differential privacy
KW - sliding window
UR - http://www.scopus.com/inward/record.url?scp=105012637278&partnerID=8YFLogxK
UR - https://go.openathens.net/redirector/westernsydney.edu.au?url=https://doi.org/10.1109/TDSC.2025.3592267
U2 - 10.1109/TDSC.2025.3592267
DO - 10.1109/TDSC.2025.3592267
M3 - Article
AN - SCOPUS:105012637278
SN - 1545-5971
VL - 22
SP - 6896
EP - 6912
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
IS - 6
ER -