Data privacy and utility trade-off based on mutual information neural estimator

In the era of big data and the Internet of Things (IoT), data owners need to share a large amount of data with the intended receivers in an insecure environment, posing a trade-off issue between user privacy and data utility. The privacy utility trade-off was facilitated through a privacy funnel bas...

Full description

Bibliographic Details
Main Authors: Chen, G. (Author), Dang, S. (Author), Tang, J. (Author), Wu, Q. (Author)
Format: Article
Language:English
Published: Elsevier Ltd 2022
Subjects:
Online Access:View Fulltext in Publisher
LEADER 02488nam a2200349Ia 4500
001 10.1016-j.eswa.2022.118012
008 220718s2022 CNT 000 0 und d
020 |a 09574174 (ISSN) 
245 1 0 |a Data privacy and utility trade-off based on mutual information neural estimator 
260 0 |b Elsevier Ltd  |c 2022 
856 |z View Fulltext in Publisher  |u https://doi.org/10.1016/j.eswa.2022.118012 
520 3 |a In the era of big data and the Internet of Things (IoT), data owners need to share a large amount of data with the intended receivers in an insecure environment, posing a trade-off issue between user privacy and data utility. The privacy utility trade-off was facilitated through a privacy funnel based on mutual information. In this article, we propose a privacy funnel which is using mutual information neural estimator (MINE) to optimize the privacy utility trade-off by estimating mutual information. Firstly, we estimate mutual information in a training way for data with unknown distributions and make the result a measure of privacy and utility. Secondly, we optimize the privacy utility trade-off by optimizing the mutual information added noise as an encoding process and minimizing cross-entropy mutual information between published data and non-sensitive data as a decoding process. Finally, simulations are conducted comparing our methodology to the Kraskov, Stögbauer, and Grassberger (KSG) estimation obtained by k-nearest neighbor as well as information bottleneck in the traditional method. Our results clearly demonstrate that the designed framework has better performance and attains convergence quicker in the scenario where enormous volumes of data are handled, and the largest data utility obtained by the MINE for a given privacy threshold is even better. © 2022 Elsevier Ltd 
650 0 4 |a Data utilities 
650 0 4 |a Economic and social effects 
650 0 4 |a Internet of things 
650 0 4 |a KL-divergence 
650 0 4 |a Large amounts of data 
650 0 4 |a Mutual information neural estimator 
650 0 4 |a Mutual informations 
650 0 4 |a Nearest neighbor search 
650 0 4 |a Neural networks 
650 0 4 |a Neural-networks 
650 0 4 |a Privacy utility trade-off 
650 0 4 |a Sensitive data 
650 0 4 |a Trade off 
650 0 4 |a User data 
650 0 4 |a User privacy 
700 1 |a Chen, G.  |e author 
700 1 |a Dang, S.  |e author 
700 1 |a Tang, J.  |e author 
700 1 |a Wu, Q.  |e author 
773 |t Expert Systems with Applications