A novel ε-sensitive correlation indistinguishable scheme for publishing location data.
Nowadays, location based service (LBS) is one of the most popular mobile apps and following with humongous of location data been produced. The publishing of location data can provide benefit for promoting the quality of service, optimizing the commercial environment as well as harmonizing the infras...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2019-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0226796&type=printable |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850184315453833216 |
|---|---|
| author | Wang Bin Zhang Lei Zhang Guoyin |
| author_facet | Wang Bin Zhang Lei Zhang Guoyin |
| author_sort | Wang Bin |
| collection | DOAJ |
| description | Nowadays, location based service (LBS) is one of the most popular mobile apps and following with humongous of location data been produced. The publishing of location data can provide benefit for promoting the quality of service, optimizing the commercial environment as well as harmonizing the infrastructure construction. However, as location data may contain some sensitive or confidential information, the publishing may reveal privacy and bring hazards. So the published data had to be disposed to protect the privacy. In order to cope with this problem, a number of algorithms based on the strategy of k-anonymity were proposed, but this is not enough for the privacy protection, as the correlation between the sensitive region and the background knowledge can be used to infer the real location. Thus, consider about this condition, in this paper a ε-sensitive correlation privacy protection scheme is proposed, and provides correlation indistinguishable to the location data. In this scheme, entropy is first used to determine the location centroid of each cell to build up the voronoi diagram. Then the coordinate of the untreated location data that is located in the cell is transferred into the centroid vicinity. Accordingly, the sensitive correlation is destroyed by the coordinate of each published data. The process of transferring the location data is determined by metrics of ε-sensitive correlation privacy, and is rigorous in mathematical justification. At last, security analysis is proposed in this paper to verify the privacy ability of our proposed algorithm based on voronoi diagram and entropy, and then we utilize the comparative experiment to further affirm the advantage of this algorithm in the location data privacy protection as well as the availability of published data. |
| format | Article |
| id | doaj-art-356bb4186a09435795bc3eff63d77d52 |
| institution | OA Journals |
| issn | 1932-6203 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj-art-356bb4186a09435795bc3eff63d77d522025-08-20T02:17:05ZengPublic Library of Science (PLoS)PLoS ONE1932-62032019-01-011412e022679610.1371/journal.pone.0226796A novel ε-sensitive correlation indistinguishable scheme for publishing location data.Wang BinZhang LeiZhang GuoyinNowadays, location based service (LBS) is one of the most popular mobile apps and following with humongous of location data been produced. The publishing of location data can provide benefit for promoting the quality of service, optimizing the commercial environment as well as harmonizing the infrastructure construction. However, as location data may contain some sensitive or confidential information, the publishing may reveal privacy and bring hazards. So the published data had to be disposed to protect the privacy. In order to cope with this problem, a number of algorithms based on the strategy of k-anonymity were proposed, but this is not enough for the privacy protection, as the correlation between the sensitive region and the background knowledge can be used to infer the real location. Thus, consider about this condition, in this paper a ε-sensitive correlation privacy protection scheme is proposed, and provides correlation indistinguishable to the location data. In this scheme, entropy is first used to determine the location centroid of each cell to build up the voronoi diagram. Then the coordinate of the untreated location data that is located in the cell is transferred into the centroid vicinity. Accordingly, the sensitive correlation is destroyed by the coordinate of each published data. The process of transferring the location data is determined by metrics of ε-sensitive correlation privacy, and is rigorous in mathematical justification. At last, security analysis is proposed in this paper to verify the privacy ability of our proposed algorithm based on voronoi diagram and entropy, and then we utilize the comparative experiment to further affirm the advantage of this algorithm in the location data privacy protection as well as the availability of published data.https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0226796&type=printable |
| spellingShingle | Wang Bin Zhang Lei Zhang Guoyin A novel ε-sensitive correlation indistinguishable scheme for publishing location data. PLoS ONE |
| title | A novel ε-sensitive correlation indistinguishable scheme for publishing location data. |
| title_full | A novel ε-sensitive correlation indistinguishable scheme for publishing location data. |
| title_fullStr | A novel ε-sensitive correlation indistinguishable scheme for publishing location data. |
| title_full_unstemmed | A novel ε-sensitive correlation indistinguishable scheme for publishing location data. |
| title_short | A novel ε-sensitive correlation indistinguishable scheme for publishing location data. |
| title_sort | novel ε sensitive correlation indistinguishable scheme for publishing location data |
| url | https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0226796&type=printable |
| work_keys_str_mv | AT wangbin anovelesensitivecorrelationindistinguishableschemeforpublishinglocationdata AT zhanglei anovelesensitivecorrelationindistinguishableschemeforpublishinglocationdata AT zhangguoyin anovelesensitivecorrelationindistinguishableschemeforpublishinglocationdata AT wangbin novelesensitivecorrelationindistinguishableschemeforpublishinglocationdata AT zhanglei novelesensitivecorrelationindistinguishableschemeforpublishinglocationdata AT zhangguoyin novelesensitivecorrelationindistinguishableschemeforpublishinglocationdata |