A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Knowledge, probability, and adversaries
Journal of the ACM (JACM)
Reasoning about knowledge
Common knowledge and update in finite environments
Information and Computation
Journal of the ACM (JACM)
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
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th 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
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information transmission in computational systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Probabilistic algorithmic knowledge
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
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
A general theory of security properties
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Reasoning about Uncertainty
Enforcing Robust Declassification
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
A logical approach to multilevel security of probabilistic systems
Distributed Computing
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Information-Flow Security for Interactive Programs
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
ACM Transactions on Information and System Security (TISSEC)
Journal of Artificial Intelligence Research
Toward privacy in public databases
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
ACM Transactions on Information and System Security (TISSEC)
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
Proceedings of the 16th ACM conference on Computer and communications security
Requirements and protocols for inference-proof interactions in information systems
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Keeping secrets in possibilistic knowledge bases with necessity-valued privacy policies
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Hypergraphs of multiparty secrets
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
A ternary knowledge relation on secrets
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Information flow on directed acyclic graphs
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
The functional dependence relation on hypergraphs of secrets
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Game semantics for the Geiger-Paz-pearl axioms of independence
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Hypergraphs of multiparty secrets
Annals of Mathematics and Artificial Intelligence
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Inference-usability confinement by maintaining inference-proof views of an information system
International Journal of Computational Science and Engineering
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Independence in Information Spaces
Studia Logica
Proving concurrent noninterference
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Information flow in trust management systems
Journal of Computer Security - CSF 2010
| Hi-index | 0.00 |
We introduce a general framework for reasoning about secrecy requirements in multiagent systems. Our definitions extend earlier definitions of secrecy and nondeducibility given by Shannon and Sutherland. Roughly speaking, one agent maintains secrecy with respect to another if the second agent cannot rule out any possibilities for the behavior or state of the first agent. We show that the framework can handle probability and nondeterminism in a clean way, is useful for reasoning about asynchronous systems as well as synchronous systems, and suggests generalizations of secrecy that may be useful for dealing with issues such as resource-bounded reasoning. We also show that a number of well-known attempts to characterize the absence of information flow are special cases of our definitions of secrecy.