Privacy policies with modal logic: the dynamic turn - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Privacy policies with modal logic: the dynamic turn


Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defined in terms of permitted and obligatory knowledge. With this new approach, we do not have to specify the permissions and prohibitions of all message combinations explicitly. To specify and reason about such privacy policies, we extend a multi-modal logic introduced by Cuppens and Demolombe with update operators modeling the dynamics of both knowledge and privacy policies. We show also how to determine the obligatory messages, how to express epistemic norms, and how to check whether a situation is compliant with respect to a privacy policy.We axiomatize and prove the decidability of our logic.
Fichier principal
Vignette du fichier
10.1007-978-3-642-14183-6_15.pdf (299.26 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00556079 , version 1 (17-01-2011)
inria-00556079 , version 2 (08-09-2013)


  • HAL Id : inria-00556079 , version 2


Guillaume Aucher, Guido Boella, Leendert van Der Torre. Privacy policies with modal logic: the dynamic turn. DEON - Deontic Logic in Computer Science - 2010, Jul 2010, Fiesole, Italy. pp.196-213. ⟨inria-00556079v2⟩
76 View
261 Download


Gmail Facebook X LinkedIn More