Computer Science – Cryptography and Security
Scientific paper
2003-07-24
Computer Science
Cryptography and Security
This is an extended version of a paper that appears in the Proceedings of the 15th IEEE Computer Security Foundations Workshop
Scientific paper
We introduce a general framework for reasoning about secrecy and privacy 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.
Halpern Joseph Y.
O'Neill Kevin R.
No associations
LandOfFree
Secrecy in Multiagent Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Secrecy in Multiagent Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secrecy in Multiagent Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-444984