zbMATH — the first resource for mathematics

Privacy policies with modal logic: the dynamic turn. (English) Zbl 1250.68241
Governatori, Guido (ed.) et al., Deontic logic in computer science. 10th international conference, DEON 2010, Fiesole, Italy, July 7–9, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14182-9/pbk). Lecture Notes in Computer Science 6181. Lecture Notes in Artificial Intelligence, 196-213 (2010).
Summary: 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.
For the entire collection see [Zbl 1196.03008].

68T27 Logic in artificial intelligence
03B45 Modal logic (including the logic of norms)
Full Text: DOI