.png){kind=icon}
.png){kind=icon}
Return
Optimized Sparse Vector Aggregation Under Local Differential Privacy
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2025.3611115.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In crowdsourcing applications, gathering and analyzing users' strong positive (1) or negative (-1) reactions to a large number of items is crucial for improving service quality, particularly in recommendation systems. However, protecting users' privacy while handling diverse sparse patterns in contexts with a large dimension sized poses significant challenges for efficient and privacy-preserving data aggregation. To address these challenges, in this paper, we propose an optimized k-sparse vector mean estimation scheme under Local Differential Privacy(LDP), ensuring that each user's entire set of up to k private values from{-1,1}satisfies epsilon-LDP. Specifically, our proposed scheme employs a seed mining technique in conjunction with PRNG Randomizer, which allows users to send their data only once while enabling the server to accurately estimate any value' smean in the domain. Our scheme achieves an asymptotically optimal per-coordinate error of O(1 epsilon root n), equivalent to that of a 1-sparse case, while also ensuring efficient communication costs. The communication cost remains at a minimal level of O(1) (only 2 bytes per user's report) for smaller k values and scales to O(k) for large r k, due to efficient binning strategies. Extensive experimental results confirm that our results align with theoretical expectations, demonstrating that our scheme not only preserves user privacy but also ensures higher accuracy compared to other schemes.
Keywords:
Vectors
Servers
Estimation
Costs
Motion pictures
Accuracy
Privacy
Differential privacy
Cryptography
Training
Crowdsourcing
local differential privacy
sparse vector aggregation
mean estimation
PRNG Randomizer
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W
Organization
View more organizations