Shortest paths anonymization on weighted graphs

Shyue Liang Wang, Yu Chuan Tsai, Hung Yu Kao, I. Hsien Ting, Tzung Pei Hong

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

Due to the proliferation of online social networking, a large number of personal data are publicly available. As such, personal attacks, reputational, financial, or family losses might occur once this personal and sensitive information falls into the hands of malicious hackers. Research on Privacy-Preserving Network Publishing has attracted much attention in recent years. But most work focus on node de-identification and link protection. In academic social networks, business transaction networks, and transportation networks, etc, node identities and link structures are public knowledge but weights and shortest paths are sensitive. In this work, we study the problem of k-anonymous path privacy. A published network graph with k-anonymous path privacy has at least k indistinguishable shortest paths between the source and destination vertices [21]. In order to achieve such privacy, three different strategies of modification on edge weights of directed graphs are proposed. Numerical comparisons show that weight-proportional-based strategy is more efficient than PageRank-based and degree-based strategies. In addition, it is also more efficient and causes less information loss than running on un-directed graphs.

原文English
頁(從 - 到)65-79
頁數15
期刊International Journal of Software Engineering and Knowledge Engineering
23
發行號1
DOIs
出版狀態Published - 2013 二月

All Science Journal Classification (ASJC) codes

  • 軟體
  • 電腦網路與通信
  • 電腦繪圖與電腦輔助設計
  • 人工智慧

指紋

深入研究「Shortest paths anonymization on weighted graphs」主題。共同形成了獨特的指紋。

引用此