Knowledge, probability, and adversaries
Journal of the ACM (JACM)
Reasoning about knowledge
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Knowledge and the logic of local propositions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Classification of Security Properties (Part I: Information Flow)
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Probabilistic Noninterference for Multi-Threaded Programs
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Possibilistic Definitions of Security - An Assembly Kit
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
A general theory of security properties
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
A logical approach to multilevel security of probabilistic systems
Distributed Computing
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
ACM SIGACT News
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Perfect cryptography, S5 knowledge, and algorithmic knowledge
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Abstractions of Multi-agent Systems
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
The Shadow Knows: Refinement and security in sequential programs
Science of Computer Programming
On interdependence of secrets in collaboration networks
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
An Independence Relation for Sets of Secrets
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Automated Analysis of Java Methods for Confidentiality
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Quantifying information flow with beliefs
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
How to Brew-up a Refinement Ordering
Electronic Notes in Theoretical Computer Science (ENTCS)
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Hypergraphs of multiparty secrets
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Preserving secrecy under refinement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A probabilistic property-specific approach to information flow
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
The shadow knows: refinement of ignorance in sequential programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Intransitive noninterference in nondeterministic systems
Proceedings of the 2012 ACM conference on Computer and communications security
Decidability of parameterized probabilistic information flow
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
We introduce a general framework for reasoning about secrecy requirements in multiagent systems. Because secrecy requirements are closely connected with the knowledge of individual agents of a system, our framework employs the modal ogic of knowledge within the context of the well-studied runs and systems framework. Put simply, "secrets" are facts about a system that low-level agents are never allowed to know. The framework presented here allows us to formalize this intuition precisely, in a way that is much in the spirit of Sutherland's notion of nondeducibility. Several well-known attempts to characterize the absence ofinformation flow, including separability, generalized non-interference, and nondeducibility on strategies, turn out to be special cases of our definition of secrecy. However, our approach lets us go well beyond these definitions. It can handle probabilistic secrecy in a clean way, and it suggests generalizations of secrecy that may be useful for dealing with resource-bounded reasoning and with issues such as downgrading of information.