Modal logic
Protecting deductive databases from unauthorized retrieval and update requests
Data & Knowledge Engineering - Data and applications security
Foundations of Secure Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
A Modal Logical Framework for Security Policies
ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
A Privacy Policy Model for Enterprises
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Web Privacy with P3p
Probabilistic Dynamic Epistemic Logic
Journal of Logic, Language and Information
Privacy and Contextual Integrity: Framework and Applications
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Privacy APIs: Access Control Techniques to Analyze and Verify Legal Privacy Policies
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
A flow-sensitive analysis of privacy properties
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Collaborative Planning With Privacy
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Privacy and Utility in Business Processes
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Dynamic Epistemic Logic
A Formalization of HIPAA for a Medical Messaging System
TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business
A universally defined undecidable unimodal logic
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A dynamic logic for privacy compliance
Artificial Intelligence and Law - Special issue on Deontic Logic and Normative Systems
Model checking agent knowledge in dynamic access control policies
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.02 |
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.