Abstract
Online social networks are indispensable platforms where people share personal data from their daily lives. However, social sharing raises many privacy issues. One of the most difficult, the “privacy paradox,” is that social-network users want to meet their social needs by enhancing interactions with their friends and are at the same time concerned about the risk of privacy leakage. This work aims to help social-network users weigh the benefits of social sharing and the costs of privacy leakage. A proposed criterion for privacy-risk measurement can quantify the probability of privacy leakage according to multi-person competitive behaviors. By analyzing the continuous competition between a user and some unwanted knowers, a general-sum stochastic game model related to the privacy paradox is constructed. The Markov decision process (MDP) and a role-mining method are introduced to facilitate the game analysis. The existence of a Nash equilibrium strategy is proved theoretically, and effective personal access-control policies are derived from this strategy as solved by a reinforcement learning algorithm. Experiments evaluate the constructed privacy stochastic game model and the new criterion for privacy-risk measurement. This work helps users develop effective personal policies in all cases to optimize their payoffs in the privacy paradox.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.