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 metadatas

https://hal.inria.fr/inria-00556079
Contributor : Guillaume Aucher <>
Submitted on : Monday, January 17, 2011 - 5:59:05 PM
Last modification on : Friday, November 8, 2019 - 3:06:02 PM
Long-term archiving on : Monday, April 18, 2011 - 2:33:29 AM

File

DEON10.PDF
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00556079, version 1

Citation

Guillaume Aucher, Guido Boella, Leendert van der Torre. Privacy policies with modal logic: the dynamic turn. Deontic Logic in Computer Science (DEON 2010), Jul 2010, Fiesole, Italy. pp.196-213. ⟨inria-00556079v1⟩

Share

Metrics

Record views

24

Files downloads

72