Game theoretic analysis of MultiParty Access Control in online social networks

Hongxin Hu, Gail-Joon Ahn, Ziming Zhao, Dejun Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

Abstract

Existing online social networks (OSNs) only allow a single user to restrict access to her/his data but cannot provide any mechanism to enforce privacy concerns over data associated with multiple users. This situation leaves privacy conflicts largely unresolved and leads to the potential disclosure of users' sensitive information. To address such an issue, a MultiParty Access Control (MPAC) model was recently proposed, including a systematic approach to identify and resolve privacy conflicts for collaborative data sharing in OSNs. In this paper, we take another step to further study the problem of analyzing the strategic behavior of rational controllers in multiparty access control, where each controller aims to maximize her/his own benefit by adjusting her/his privacy setting in collaborative data sharing in OSNs. We first formulate this problem as a multiparty control game and show the existence of unique Nash Equilibrium (NE) which is critical because at an NE, no controller has any incentive to change her/his privacy setting. We then present algorithms to compute the NE and prove that the system can converge to the NE in only a few iterations. A numerical analysis is also provided for different scenarios that illustrate the interplay of controllers in the multiparty control game. In addition, we conduct user studies of the multiparty control game to explore the gap between game theoretic approaches and real human behaviors.

Original languageEnglish (US)
Title of host publicationProceedings of ACM Symposium on Access Control Models and Technologies, SACMAT
PublisherAssociation for Computing Machinery
Pages93-102
Number of pages10
ISBN (Print)9781450329392
DOIs
StatePublished - 2014
Event19th ACM Symposium on Access Control Models and Technologies, SACMAT 2014 - London, ON, Canada
Duration: Jun 25 2014Jun 27 2014

Other

Other19th ACM Symposium on Access Control Models and Technologies, SACMAT 2014
CountryCanada
CityLondon, ON
Period6/25/146/27/14

Fingerprint

Access control
Controllers
Numerical analysis

Keywords

  • Game theory
  • MultiParty Access Control
  • Social networks

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality
  • Information Systems

Cite this

Hu, H., Ahn, G-J., Zhao, Z., & Yang, D. (2014). Game theoretic analysis of MultiParty Access Control in online social networks. In Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT (pp. 93-102). Association for Computing Machinery. https://doi.org/10.1145/2613087.2613097

Game theoretic analysis of MultiParty Access Control in online social networks. / Hu, Hongxin; Ahn, Gail-Joon; Zhao, Ziming; Yang, Dejun.

Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT. Association for Computing Machinery, 2014. p. 93-102.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hu, H, Ahn, G-J, Zhao, Z & Yang, D 2014, Game theoretic analysis of MultiParty Access Control in online social networks. in Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT. Association for Computing Machinery, pp. 93-102, 19th ACM Symposium on Access Control Models and Technologies, SACMAT 2014, London, ON, Canada, 6/25/14. https://doi.org/10.1145/2613087.2613097
Hu H, Ahn G-J, Zhao Z, Yang D. Game theoretic analysis of MultiParty Access Control in online social networks. In Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT. Association for Computing Machinery. 2014. p. 93-102 https://doi.org/10.1145/2613087.2613097
Hu, Hongxin ; Ahn, Gail-Joon ; Zhao, Ziming ; Yang, Dejun. / Game theoretic analysis of MultiParty Access Control in online social networks. Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT. Association for Computing Machinery, 2014. pp. 93-102
@inproceedings{2dba1b7094bb49b085de779fd459bf8f,
title = "Game theoretic analysis of MultiParty Access Control in online social networks",
abstract = "Existing online social networks (OSNs) only allow a single user to restrict access to her/his data but cannot provide any mechanism to enforce privacy concerns over data associated with multiple users. This situation leaves privacy conflicts largely unresolved and leads to the potential disclosure of users' sensitive information. To address such an issue, a MultiParty Access Control (MPAC) model was recently proposed, including a systematic approach to identify and resolve privacy conflicts for collaborative data sharing in OSNs. In this paper, we take another step to further study the problem of analyzing the strategic behavior of rational controllers in multiparty access control, where each controller aims to maximize her/his own benefit by adjusting her/his privacy setting in collaborative data sharing in OSNs. We first formulate this problem as a multiparty control game and show the existence of unique Nash Equilibrium (NE) which is critical because at an NE, no controller has any incentive to change her/his privacy setting. We then present algorithms to compute the NE and prove that the system can converge to the NE in only a few iterations. A numerical analysis is also provided for different scenarios that illustrate the interplay of controllers in the multiparty control game. In addition, we conduct user studies of the multiparty control game to explore the gap between game theoretic approaches and real human behaviors.",
keywords = "Game theory, MultiParty Access Control, Social networks",
author = "Hongxin Hu and Gail-Joon Ahn and Ziming Zhao and Dejun Yang",
year = "2014",
doi = "10.1145/2613087.2613097",
language = "English (US)",
isbn = "9781450329392",
pages = "93--102",
booktitle = "Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Game theoretic analysis of MultiParty Access Control in online social networks

AU - Hu, Hongxin

AU - Ahn, Gail-Joon

AU - Zhao, Ziming

AU - Yang, Dejun

PY - 2014

Y1 - 2014

N2 - Existing online social networks (OSNs) only allow a single user to restrict access to her/his data but cannot provide any mechanism to enforce privacy concerns over data associated with multiple users. This situation leaves privacy conflicts largely unresolved and leads to the potential disclosure of users' sensitive information. To address such an issue, a MultiParty Access Control (MPAC) model was recently proposed, including a systematic approach to identify and resolve privacy conflicts for collaborative data sharing in OSNs. In this paper, we take another step to further study the problem of analyzing the strategic behavior of rational controllers in multiparty access control, where each controller aims to maximize her/his own benefit by adjusting her/his privacy setting in collaborative data sharing in OSNs. We first formulate this problem as a multiparty control game and show the existence of unique Nash Equilibrium (NE) which is critical because at an NE, no controller has any incentive to change her/his privacy setting. We then present algorithms to compute the NE and prove that the system can converge to the NE in only a few iterations. A numerical analysis is also provided for different scenarios that illustrate the interplay of controllers in the multiparty control game. In addition, we conduct user studies of the multiparty control game to explore the gap between game theoretic approaches and real human behaviors.

AB - Existing online social networks (OSNs) only allow a single user to restrict access to her/his data but cannot provide any mechanism to enforce privacy concerns over data associated with multiple users. This situation leaves privacy conflicts largely unresolved and leads to the potential disclosure of users' sensitive information. To address such an issue, a MultiParty Access Control (MPAC) model was recently proposed, including a systematic approach to identify and resolve privacy conflicts for collaborative data sharing in OSNs. In this paper, we take another step to further study the problem of analyzing the strategic behavior of rational controllers in multiparty access control, where each controller aims to maximize her/his own benefit by adjusting her/his privacy setting in collaborative data sharing in OSNs. We first formulate this problem as a multiparty control game and show the existence of unique Nash Equilibrium (NE) which is critical because at an NE, no controller has any incentive to change her/his privacy setting. We then present algorithms to compute the NE and prove that the system can converge to the NE in only a few iterations. A numerical analysis is also provided for different scenarios that illustrate the interplay of controllers in the multiparty control game. In addition, we conduct user studies of the multiparty control game to explore the gap between game theoretic approaches and real human behaviors.

KW - Game theory

KW - MultiParty Access Control

KW - Social networks

UR - http://www.scopus.com/inward/record.url?scp=84904460092&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904460092&partnerID=8YFLogxK

U2 - 10.1145/2613087.2613097

DO - 10.1145/2613087.2613097

M3 - Conference contribution

SN - 9781450329392

SP - 93

EP - 102

BT - Proceedings of ACM Symposium on Access Control Models and Technologies, SACMAT

PB - Association for Computing Machinery

ER -