Skip to Main content Skip to Navigation
Conference papers

Privacy policies with modal logic: the dynamic turn

Abstract : 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.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Guillaume Aucher Connect in order to contact the contributor
Submitted on : Sunday, September 8, 2013 - 7:08:51 PM
Last modification on : Friday, November 8, 2019 - 3:06:02 PM
Long-term archiving on: : Monday, December 9, 2013 - 4:22:58 AM


Publisher files allowed on an open archive


  • 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⟩



Les métriques sont temporairement indisponibles