By Topic

Anonymizing Multiple K-anonymous Shortest Paths for Social Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Shyue-Liang Wang ; Nat. Univ. of Kaohsiung, Kaohsiung, Taiwan ; Zheng-Ze Tsai ; Tzung-Pei Hong ; I-Hsien Ting
more authors

To preserve privacy, k-anonymity on relational, set-valued, and graph data have been studied extensively in recent years. Information on social networks can be modeled as un-weighted or weighted graph data for sharing and publishing. We have previously proposed k-anonymous path privacy concept on weighted social graphs to preserve privacy of the shortest path [9]. A published social network graph with k-anonymous path privacy has at least k indistinguishable shortest paths between the source and destination vertices. However, previous work only considered modifying Never-Visited (NV) edges by other shortest paths. In this work, we further extend the approach and propose a new technique that can modify both NV edges and All-Visited (AV) edges to achieve the k-anonymous path privacy. Experimental results showing the characteristics of each technique are presented. It clearly provides different options to achieve the same level of privacy under different requirements.

Published in:

Innovations in Bio-inspired Computing and Applications (IBICA), 2011 Second International Conference on

Date of Conference:

16-18 Dec. 2011