Privacy policies with modal logic: the dynamic turn
DEON'10 Proceedings of the 10th international conference on Deontic logic in computer science
Collaborative Planning with Confidentiality
Journal of Automated Reasoning
Calculus of cooperation and game-based reasoning about protocol privacy
ACM Transactions on Computational Logic (TOCL)
A dynamic logic for privacy compliance
Artificial Intelligence and Law - Special issue on Deontic Logic and Normative Systems
| Hi-index | 0.00 |
Collaboration among organizations or individuals is common. While these participants are often unwilling to share all their information with each other, some information sharing is unavoidable when achieving a common goal. The need to share information and the desire to keep it private/ secret are two competing notions which affect the outcome of a collaboration. This paper proposes a formal model of collaboration which addresses privacy/secrecy concerns. We draw on the notion of a plan which originates in the AI literature. We consider transition systems in which actions have pre- and post-conditions of the same size. We show it is PSPACE-complete to decide whether a given such system protects the privacy/secrecy of its participants and whether it contains a plan leading from a given initial state to a desired goal state.