Multi-Party Privacy Conflict Management in Online Social Networks: A Network Game Perspective

被引:14
作者
Ding, Kemi [1 ,2 ]
Zhang, Junshan [1 ]
机构
[1] Arizona State Univ, Sch Elect Comp & Energy Engn, Tempe, AZ 85287 USA
[2] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
关键词
Games; Privacy; Convergence; Data privacy; IEEE transactions; Facebook; Multi-party privacy conflict; online social network; networked game; convergence analysis;
D O I
10.1109/TNET.2020.3016315
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this work, we consider the multi-party privacy conflict (MPC) in an online social network (OSN). As many data items uploaded to the OSN are "co-owned" by multiple users with different privacy concerns, some personal information of OSN users may be disclosed by others unintentionally. On the contrary with existing mainstream OSN platforms allowing only the very user uploading the data to set the privacy level, in this article we take a fine-grained approach to resolve MPC, in which all co-owners independently determine whether to share their personal content within the data on OSN. Interacted with its peers, the opinion of a co-owner, however, might be influenced by and consequently influence the decision of its peers. To this end, each co-owner, as an individual decision maker, strikes a tradeoff between its internal privacy preference and the external social influence from its neighbors in a OSN. Specifically, we formulate the interaction among co-owners as a multi-player non-cooperative game with a network structure representing their social relations. For the proposed network game, we establish the existence of multiple (pure-strategy) equilibria, and characterize them accordingly. The convergence of interaction is also investigated when synchronous and asynchronous best-response updates are used, respectively. We note that when the action set for the players is discrete, the game exhibits non-linear dynamics, making it challenging to analyze the convergence behavior. We prove that synchronous update may lead to either an equilibrium or a strategy cycle, and the asynchronous update always leads to an equilibrium. Building upon this analysis, we advocate a practical implementation of the proposed MPC management, which balances the automation of the management and intervention of users. Moreover, we take one step further to develop approaches aiming to reach a "stronger agreement" among the players for the sake of benefits of uploader and OSN provider. Numerical examples are also provided to corroborate the analytical results.
引用
收藏
页码:2685 / 2698
页数:14
相关论文
共 26 条
[1]  
[Anonymous], 2007, ALGORITHMIC GAME THE
[2]  
[Anonymous], 2018, NEW YORK TIMES
[3]  
[Anonymous], 2011, Synthesis Lectures on Communication Networks
[4]   Collaborative Access Control in On-line Social Networks (Invited Paper) [J].
Canninati, Barbara ;
Ferrari, Elena .
PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING (COLLABORATECOM), 2011, :231-240
[5]  
Cheng D., 2012, An Introduction to Semi-tensor Product of Matrices and Its Applications
[6]  
Cheng DH, 2011, COMMUN CONTROL ENG, P1, DOI 10.1007/978-0-85729-097-7
[7]   A FORMAL THEORY OF SOCIAL POWER [J].
FRENCH, JRP .
PSYCHOLOGICAL REVIEW, 1956, 63 (03) :181-194
[8]  
Friedkin N. E., 2006, STRUCTURAL THEORY SO, V13
[9]   Information Sharing and Privacy in Networks [J].
Gradwohl, Ronen .
EC'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2017, :349-350
[10]   Game Theoretic Analysis of Multiparty Access Control in Online Social Networks [J].
Hu, Hongxin ;
Ahn, Gail-Joon ;
Zhao, Ziming ;
Yang, Dejun .
PROCEEDINGS OF THE 19TH ACM SYMPOSIUM ON ACCESS CONTROL MODELS AND TECHNOLOGIES (SACMAT'14), 2014, :93-102