A logical framework for privacy-preserving social network publication

被引:11
作者
Hsu, Tsan-Sheng [1 ]
Liau, Churn-Jung [1 ]
Wang, Da-Wei [1 ]
机构
[1] Acad Sinica, Inst Informat Sci, Taipei 115, Taiwan
关键词
Social network; Privacy; Description logic; Positional analysis; Information granule; REGULAR EQUIVALENCES; K-ANONYMITY; PROTECTION; DATABASE; WEB;
D O I
10.1016/j.jal.2013.12.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Social network analysis is an important methodology in sociological research. Although social network data are valuable resources for data analysis, releasing the data to the public may cause an invasion of privacy. In this paper, we consider privacy preservation in the context of publishing social network data. To address privacy concerns, information about a social network can be released in two ways. Either the global structure of the network can be released in an anonymized way; or non-sensitive information about the actors in the network can be accessed via a query-answering process. However, an attacker could re-identify the actors in the network by combining information obtained in these two ways. The resulting privacy risk depends on the amount of detail in the released network structure and expressiveness of the admissible queries. In particular, different sets of admissible queries correspond to different types of attacks. In this paper, we propose a logical framework that can represent different attack models uniformly. Specifically, in the framework, individuals that satisfy the same subset of admissible queries are considered indiscernible by the attacker. By partitioning a social network into equivalence classes (i.e., information granules) based on the indiscernibility relation, we can generalize the privacy criteria developed for tabulated data to social network data. To exemplify the usability of the framework, we consider two instances of the framework, where the sets of admissible queries are the ALCI and ALCQI concept terms respectively; and we exploit social position analysis techniques to compute their indiscernibility relations. We also show how the framework can be extended to deal with the privacy-preserving publication of weighted social network data. The uniformity of the framework provides us with a common ground to compare existing attack models; while its generality could extend the scope of research to meet privacy concerns in the era of social semantic computing. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:151 / 174
页数:24
相关论文
共 70 条
[1]  
[Anonymous], 1971, Journal of Mathematical Sociology, DOI 10.1080/0022250X.1971.9989788
[2]  
[Anonymous], 2006, ACM T KNOWL DISCOV D
[3]  
[Anonymous], 2007, P 16 INT C WORLD WID
[4]  
[Anonymous], 2008, Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data
[5]  
[Anonymous], 2002, Cambridge Tracts in Theoretical Computer Science
[6]  
[Anonymous], 1994, Handbook of Logic in Artificial Intelligence and Logic Programming. Ed. by
[7]  
Baader F, 2003, DESCRIPTION LOGIC HANDBOOK: THEORY, IMPLEMENTATION AND APPLICATIONS, P43
[8]   The architecture of complex weighted networks [J].
Barrat, A ;
Barthélemy, M ;
Pastor-Satorras, R ;
Vespignani, A .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 (11) :3747-3752
[9]   THE CLASS OF ALL REGULAR EQUIVALENCES - ALGEBRAIC STRUCTURE AND COMPUTATION [J].
BORGATTI, SP ;
EVERETT, MG .
SOCIAL NETWORKS, 1989, 11 (01) :65-88
[10]   On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice [J].
Bou, Felix ;
Esteva, Francesc ;
Godo, Lluis ;
Oscar Rodriguez, Ricardo .
JOURNAL OF LOGIC AND COMPUTATION, 2011, 21 (05) :739-790