Cargando…

Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating

With the rapid development of information technology, large-scale personal data, including those collected by sensors or IoT devices, is stored in the cloud or data centers. In some cases, the owners of the cloud or data centers need to publish the data. Therefore, how to make the best use of the da...

Descripción completa

Detalles Bibliográficos
Autores principales: Shi, Yancheng, Zhang, Zhenjiang, Chao, Han-Chieh, Shen, Bo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6068819/
https://www.ncbi.nlm.nih.gov/pubmed/30013012
http://dx.doi.org/10.3390/s18072307
_version_ 1783343353735151616
author Shi, Yancheng
Zhang, Zhenjiang
Chao, Han-Chieh
Shen, Bo
author_facet Shi, Yancheng
Zhang, Zhenjiang
Chao, Han-Chieh
Shen, Bo
author_sort Shi, Yancheng
collection PubMed
description With the rapid development of information technology, large-scale personal data, including those collected by sensors or IoT devices, is stored in the cloud or data centers. In some cases, the owners of the cloud or data centers need to publish the data. Therefore, how to make the best use of the data in the risk of personal information leakage has become a popular research topic. The most common method of data privacy protection is the data anonymization, which has two main problems: (1) The availability of information after clustering will be reduced, and it cannot be flexibly adjusted. (2) Most methods are static. When the data is released multiple times, it will cause personal privacy leakage. To solve the problems, this article has two contributions. The first one is to propose a new method based on micro-aggregation to complete the process of clustering. In this way, the data availability and the privacy protection can be adjusted flexibly by considering the concepts of distance and information entropy. The second contribution of this article is to propose a dynamic update mechanism that guarantees that the individual privacy is not compromised after the data has been subjected to multiple releases, and minimizes the loss of information. At the end of the article, the algorithm is simulated with real data sets. The availability and advantages of the method are demonstrated by calculating the time, the average information loss and the number of forged data.
format Online
Article
Text
id pubmed-6068819
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-60688192018-08-07 Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating Shi, Yancheng Zhang, Zhenjiang Chao, Han-Chieh Shen, Bo Sensors (Basel) Article With the rapid development of information technology, large-scale personal data, including those collected by sensors or IoT devices, is stored in the cloud or data centers. In some cases, the owners of the cloud or data centers need to publish the data. Therefore, how to make the best use of the data in the risk of personal information leakage has become a popular research topic. The most common method of data privacy protection is the data anonymization, which has two main problems: (1) The availability of information after clustering will be reduced, and it cannot be flexibly adjusted. (2) Most methods are static. When the data is released multiple times, it will cause personal privacy leakage. To solve the problems, this article has two contributions. The first one is to propose a new method based on micro-aggregation to complete the process of clustering. In this way, the data availability and the privacy protection can be adjusted flexibly by considering the concepts of distance and information entropy. The second contribution of this article is to propose a dynamic update mechanism that guarantees that the individual privacy is not compromised after the data has been subjected to multiple releases, and minimizes the loss of information. At the end of the article, the algorithm is simulated with real data sets. The availability and advantages of the method are demonstrated by calculating the time, the average information loss and the number of forged data. MDPI 2018-07-16 /pmc/articles/PMC6068819/ /pubmed/30013012 http://dx.doi.org/10.3390/s18072307 Text en © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Shi, Yancheng
Zhang, Zhenjiang
Chao, Han-Chieh
Shen, Bo
Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating
title Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating
title_full Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating
title_fullStr Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating
title_full_unstemmed Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating
title_short Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating
title_sort data privacy protection based on micro aggregation with dynamic sensitive attribute updating
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6068819/
https://www.ncbi.nlm.nih.gov/pubmed/30013012
http://dx.doi.org/10.3390/s18072307
work_keys_str_mv AT shiyancheng dataprivacyprotectionbasedonmicroaggregationwithdynamicsensitiveattributeupdating
AT zhangzhenjiang dataprivacyprotectionbasedonmicroaggregationwithdynamicsensitiveattributeupdating
AT chaohanchieh dataprivacyprotectionbasedonmicroaggregationwithdynamicsensitiveattributeupdating
AT shenbo dataprivacyprotectionbasedonmicroaggregationwithdynamicsensitiveattributeupdating