Confining edge types in K-anonymization of shortest paths

Yu Chuan Tsai, Shyue Liang Wang, Hung-Yu Kao, Tzung Pei Hong

研究成果: Paper

1 引文 (Scopus)

摘要

In recent years, the problem of privacy preservation on published social networks has become more and more important. The social media data are available on the popular on-line social network websites with rich personal information, which can be analyzed for connectivity and user behaviors. In this work, we study the problem of preserving sensitive paths in social networks. We examine the new concept called k-anonymous path privacy and propose two algorithms, based on the greedy approach with two different types of edges, namely Partially-Visited (PV) edges and None-Visited (NV) edges, which minimally perturbed the edge weights to achieve the path anonymity under different requirements. The numerical experiments showing the characteristics of the proposed algorithms are given. The results demonstrate that the proposed algorithms are feasible to achieve the k-anonymous path privacy, with different performances on directed and un-directed weighted graphs, and could be applied to different privacy requirements.

原文English
頁面318-322
頁數5
DOIs
出版狀態Published - 2012 十二月 12
事件3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012 - Kaohsiung City, Taiwan
持續時間: 2012 九月 262012 九月 28

Other

Other3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012
國家Taiwan
城市Kaohsiung City
期間12-09-2612-09-28

指紋

Directed graphs
Websites
Experiments

All Science Journal Classification (ASJC) codes

  • Bioengineering
  • Software

引用此文

Tsai, Y. C., Wang, S. L., Kao, H-Y., & Hong, T. P. (2012). Confining edge types in K-anonymization of shortest paths. 318-322. 論文發表於 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan. https://doi.org/10.1109/IBICA.2012.18
Tsai, Yu Chuan ; Wang, Shyue Liang ; Kao, Hung-Yu ; Hong, Tzung Pei. / Confining edge types in K-anonymization of shortest paths. 論文發表於 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan.5 p.
@conference{b9fa30dcbf284389a07b7ddfe4fdbb87,
title = "Confining edge types in K-anonymization of shortest paths",
abstract = "In recent years, the problem of privacy preservation on published social networks has become more and more important. The social media data are available on the popular on-line social network websites with rich personal information, which can be analyzed for connectivity and user behaviors. In this work, we study the problem of preserving sensitive paths in social networks. We examine the new concept called k-anonymous path privacy and propose two algorithms, based on the greedy approach with two different types of edges, namely Partially-Visited (PV) edges and None-Visited (NV) edges, which minimally perturbed the edge weights to achieve the path anonymity under different requirements. The numerical experiments showing the characteristics of the proposed algorithms are given. The results demonstrate that the proposed algorithms are feasible to achieve the k-anonymous path privacy, with different performances on directed and un-directed weighted graphs, and could be applied to different privacy requirements.",
author = "Tsai, {Yu Chuan} and Wang, {Shyue Liang} and Hung-Yu Kao and Hong, {Tzung Pei}",
year = "2012",
month = "12",
day = "12",
doi = "10.1109/IBICA.2012.18",
language = "English",
pages = "318--322",
note = "3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012 ; Conference date: 26-09-2012 Through 28-09-2012",

}

Tsai, YC, Wang, SL, Kao, H-Y & Hong, TP 2012, 'Confining edge types in K-anonymization of shortest paths' 論文發表於 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan, 12-09-26 - 12-09-28, 頁 318-322. https://doi.org/10.1109/IBICA.2012.18

Confining edge types in K-anonymization of shortest paths. / Tsai, Yu Chuan; Wang, Shyue Liang; Kao, Hung-Yu; Hong, Tzung Pei.

2012. 318-322 論文發表於 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan.

研究成果: Paper

TY - CONF

T1 - Confining edge types in K-anonymization of shortest paths

AU - Tsai, Yu Chuan

AU - Wang, Shyue Liang

AU - Kao, Hung-Yu

AU - Hong, Tzung Pei

PY - 2012/12/12

Y1 - 2012/12/12

N2 - In recent years, the problem of privacy preservation on published social networks has become more and more important. The social media data are available on the popular on-line social network websites with rich personal information, which can be analyzed for connectivity and user behaviors. In this work, we study the problem of preserving sensitive paths in social networks. We examine the new concept called k-anonymous path privacy and propose two algorithms, based on the greedy approach with two different types of edges, namely Partially-Visited (PV) edges and None-Visited (NV) edges, which minimally perturbed the edge weights to achieve the path anonymity under different requirements. The numerical experiments showing the characteristics of the proposed algorithms are given. The results demonstrate that the proposed algorithms are feasible to achieve the k-anonymous path privacy, with different performances on directed and un-directed weighted graphs, and could be applied to different privacy requirements.

AB - In recent years, the problem of privacy preservation on published social networks has become more and more important. The social media data are available on the popular on-line social network websites with rich personal information, which can be analyzed for connectivity and user behaviors. In this work, we study the problem of preserving sensitive paths in social networks. We examine the new concept called k-anonymous path privacy and propose two algorithms, based on the greedy approach with two different types of edges, namely Partially-Visited (PV) edges and None-Visited (NV) edges, which minimally perturbed the edge weights to achieve the path anonymity under different requirements. The numerical experiments showing the characteristics of the proposed algorithms are given. The results demonstrate that the proposed algorithms are feasible to achieve the k-anonymous path privacy, with different performances on directed and un-directed weighted graphs, and could be applied to different privacy requirements.

UR - http://www.scopus.com/inward/record.url?scp=84870668229&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870668229&partnerID=8YFLogxK

U2 - 10.1109/IBICA.2012.18

DO - 10.1109/IBICA.2012.18

M3 - Paper

AN - SCOPUS:84870668229

SP - 318

EP - 322

ER -

Tsai YC, Wang SL, Kao H-Y, Hong TP. Confining edge types in K-anonymization of shortest paths. 2012. 論文發表於 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan. https://doi.org/10.1109/IBICA.2012.18