Specification of Evolving Privacy Policies for Online Social Networks
Paper i proceeding, 2016

Online Social Networks are ubiquitous, bringing not only numerous new possibilities but also big threats and challenges. Privacy is one of them. Most social networks today offer a limited set of (static) privacy settings, not being able to express dynamic policies. For instance, users might decide to protect their location during the night, or share information with difference audiences depending on their current position. In this paper we introduce T FPPF, a formal framework to express, and reason about, dynamic (and recurrent) privacy policies that are activated or deactivated by context (events) or time. Besides a formal policy language (T PPL), the framework includes a knowledge-based logic extended with (linear) temporal operators and a learning modality (T KBL). Policies, and formulae in the logic, are interpreted over (timed) traces representing the evolution of the social network. We prove that checking privacy policy conformance, and the model-checking problem for T KBL, are both decidable.

Electrical &

Engineering

Computer Science

Information Systems

LOGIC

Electronic

Författare

Raul Pardo Jimenez

Chalmers, Data- och informationsteknik, Programvaruteknik

I. Kellyerova

C. Sanchez

Gerardo Schneider

Göteborgs universitet

Proceedings 23rd International Symposium on Temporal Representation and Reasoning - Time 2016

70-79

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1109/time.2016.15

ISBN

978-1-5090-3825-1