Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
The direct simulation of Minsky machines in linear logic
Proceedings of the workshop on Advances in linear logic
Artificial Intelligence - Special volume on planning and scheduling
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The platform for privacy preferences
Communications of the ACM
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Privacy and Contextual Integrity: Framework and Applications
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Reconciling while tolerating disagreement in collaborative data sharing
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Enforcing robust declassification and qualified robustness
Journal of Computer Security - Special issue on CSFW17
Non-Interference in Constructive Authorization Logic
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Relating State-Based and Process-Based Concurrency through Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Mathematical Structures in Computer Science
Analysis of privacy loss in distributed constraint optimization
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Policy Compliance in Collaborative Systems
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
Policy compliance, confidentiality and complexity in collaborative systems
Policy compliance, confidentiality and complexity in collaborative systems
Model checking on trees with path equivalences
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Preserving secrecy under refinement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A linear logic of authorization and knowledge
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Bounded memory Dolev-Yao adversaries in collaborative systems
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
On the Complexity of Linear Authorization Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| 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 confidential are two competing notions which affect the outcome of a collaboration. This paper proposes a formal model of collaboration which addresses confidentiality concerns. We draw on the notion of a plan which originates in the AI literature. We use data confidentiality policies to assess confidentiality in transition systems whose actions have an equal number of predicates in their pre- and post-conditions. Under two natural notions of policy compliance, we show that it is PSPACE-complete to schedule a plan leading from a given initial state to a desired goal state while simultaneously deciding compliance with respect to the agents' policies.