DPCrowd: Privacy-preserving and Communication-efficient Decentralized Statistical Estimation for Real-time Crowd-sourced Data
Xuebin Ren, Chia-Mu Yu, Wei Yu, Xinyu Yang, Jun Zhao, Shusen Yang

TL;DR
DPCrowd introduces a privacy-preserving, communication-efficient decentralized algorithm for real-time statistical estimation in IoT crowd-sourcing, leveraging temporal and spatial correlations to improve accuracy and privacy.
Contribution
The paper proposes DPCrowd and DPCrowd+ algorithms that enhance privacy and communication efficiency in decentralized real-time crowd-sourced data analysis.
Findings
Significantly better accuracy compared to existing methods.
Effective privacy protection with minimal utility loss.
Reduced communication overhead in decentralized networks.
Abstract
In Internet of Things (IoT) driven smart-world systems, real-time crowd-sourced databases from multiple distributed servers can be aggregated to extract dynamic statistics from a larger population, thus providing more reliable knowledge for our society. Particularly, multiple distributed servers in a decentralized network can realize real-time collaborative statistical estimation by disseminating statistics from their separate databases. Despite no raw data sharing, the real-time statistics could still expose the data privacy of crowd-sourcing participants. For mitigating the privacy concern, while traditional differential privacy (DP) mechanism can be simply implemented to perturb the statistics in each timestamp and independently for each dimension, this may suffer a great utility loss from the real-time and multi-dimensional crowd-sourced data. Also, the real-time broadcasting would…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
