DocumentCode
623893
Title
Outsourcing privacy-preserving social networks to a cloud
Author
Guojun Wang ; Qin Liu ; Feng Li ; Shuhui Yang ; Jie Wu
Author_Institution
Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China
fYear
2013
fDate
14-19 April 2013
Firstpage
2886
Lastpage
2894
Abstract
In the real world, companies would publish social networks to a third party, e.g., a cloud service provider, for marketing reasons. Preserving privacy when publishing social network data becomes an important issue. In this paper, we identify a novel type of privacy attack, termed 1*-neighborhood attack. We assume that an attacker has knowledge about the degrees of a target´s one-hop neighbors, in addition to the target´s 1-neighborhood graph, which consists of the one-hop neighbors of the target and the relationships among these neighbors. With this information, an attacker may re-identify the target from a k-anonymity social network with a probability higher than 1/k, where any node´s 1-neighborhood graph is isomorphic with k - 1 other nodes´ graphs. To resist the 1*-neighborhood attack, we define a key privacy property, probability indistinguishability, for an outsourced social network, and propose a heuristic indistinguishable group anonymization (HIGA) scheme to generate an anonymized social network with this privacy property. The empirical study indicates that the anonymized social networks can still be used to answer aggregate queries with high accuracy.
Keywords
cloud computing; data privacy; graph theory; outsourcing; query processing; social networking (online); 1*-neighborhood attack; 1-neighborhood graph; HIGA; aggregate queries; anonymized social network; cloud service provider; heuristic indistinguishable group anonymization scheme; k-anonymity social network; marketing reasons; one-hop neighbors; privacy attack; privacy property; privacy-preserving social network outsourcing; Aggregates; Educational institutions; Measurement; Outsourcing; Privacy; Probabilistic logic; Social network services; Cloud computing; privacy; probability indistinguishability; social networks;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2013 Proceedings IEEE
Conference_Location
Turin
ISSN
0743-166X
Print_ISBN
978-1-4673-5944-3
Type
conf
DOI
10.1109/INFCOM.2013.6567099
Filename
6567099
Link To Document