CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

An automata-based approach to evolving privacy policies for social networks

Raul Pardo Jimenez (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; C. Colombo ; G.J. Pace ; Gerardo Schneider
Lecture Notes in Computer Science. 16th International Conference on Runtime Verification, RV 2016, Madrid, Spain, 23-30 September 2016 (0302-9743). Vol. 10012 LNCS, 2016 (2016), p. 285-301.
[Konferensbidrag, refereegranskat]

Online Social Networks (OSNs) are ubiquitous, with more than 70% of Internet users being active users of such networking services. This widespread use of OSNs brings with it big threats and challenges, privacy being one of them. Most OSNs today offer a limited set of (static) privacy settings and do not allow for the definition, even less enforcement, of more dynamic privacy policies. In this paper we are concerned with the specification and enforcement of dynamic (and recurrent) privacy policies that are activated or deactivated by context (events). In particular, we present a novel formalism of policy automata, transition systems where privacy policies may be defined per state. We further propose an approach based on runtime verification techniques to define and enforce such policies. We provide a proof-of-concept implementation for the distributed social network Diaspora, using the runtime verification tool Larva to synthesise enforcement monitors.



Denna post skapades 2016-11-02. Senast ändrad 2016-11-30.
CPL Pubid: 244656

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)
Institutionen för data- och informationsteknik, datavetenskap (GU) (GU)

Ämnesområden

Data- och informationsvetenskap

Chalmers infrastruktur