TY - GEN
T1 - A Validated Privacy-Utility Preserving Recommendation System with Local Differential Privacy
AU - Rahali, Seryne
AU - Laurent, Maryline
AU - Masmoudi, Souha
AU - Roux, Charles
AU - Mazeau, Brice
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - This paper proposes a new recommendation system preserving both privacy and utility. It relies on the local differential privacy (LDP) for the browsing user to transmit his noisy preference profile, as perturbed Bloom filters, to the service provider. The originality of the approach is multifold. First, as far as we know, the approach is the first one including at the user side two perturbation rounds - PRR (Permanent Randomized Response) and IRR (Instantaneous Randomized Response) - over a complete user profile. Second, a full validation experimentation chain is set up, with a machine learning decoding algorithm based on neural network or XGBoost for decoding the perturbed Bloom filters and the clustering Kmeans tool for clustering users. Third, extensive experiments show that our method achieves good utility-privacy trade-off, i.e. a 90% clustering success rate, resp. 80.3% for a value of LDP $\epsilon=0.8$, resp. $\epsilon=2$. Fourth, an experimental and theoretical analysis gives concrete results on the resistance of our approach to the plausible deniability and resistance against averaging attacks.
AB - This paper proposes a new recommendation system preserving both privacy and utility. It relies on the local differential privacy (LDP) for the browsing user to transmit his noisy preference profile, as perturbed Bloom filters, to the service provider. The originality of the approach is multifold. First, as far as we know, the approach is the first one including at the user side two perturbation rounds - PRR (Permanent Randomized Response) and IRR (Instantaneous Randomized Response) - over a complete user profile. Second, a full validation experimentation chain is set up, with a machine learning decoding algorithm based on neural network or XGBoost for decoding the perturbed Bloom filters and the clustering Kmeans tool for clustering users. Third, extensive experiments show that our method achieves good utility-privacy trade-off, i.e. a 90% clustering success rate, resp. 80.3% for a value of LDP $\epsilon=0.8$, resp. $\epsilon=2$. Fourth, an experimental and theoretical analysis gives concrete results on the resistance of our approach to the plausible deniability and resistance against averaging attacks.
KW - Bloom filters
KW - Kmeans
KW - Local differential privacy
KW - RAPPOR
KW - XGBoost
KW - neural networks
KW - privacy
KW - profiles perturbation
KW - recommendation
UR - https://www.scopus.com/pages/publications/85127189931
U2 - 10.1109/BigDataSE53435.2021.00026
DO - 10.1109/BigDataSE53435.2021.00026
M3 - Conference contribution
AN - SCOPUS:85127189931
T3 - Proceedings - 2021 IEEE 15th International Conference on Big Data Science and Engineering, BigDataSE 2021
SP - 118
EP - 127
BT - Proceedings - 2021 IEEE 15th International Conference on Big Data Science and Engineering, BigDataSE 2021
A2 - Hu, Jia
A2 - Mumtaz, Shahid
A2 - Cheng, Xinzhou
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th IEEE International Conference on Big Data Science and Engineering, BigDataSE 2021
Y2 - 20 October 2021 through 22 October 2021
ER -