2003/07/24 by Kevin O’Neill, Kevin R. O'Neill, Joseph Y. Halpern +2 · 3 citations
Computer Science · Engineering · #Blockchain Technology Applications and Security #Computability, Logic, AI Algorithms #Cryptography and Security (cs.CR) #D.4.6 #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Smart Grid Security and Resilience #cs.CR #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0307057
This is an extended version of a paper that appears in the Proceedings of the 15th IEEE Computer Security Foundations Workshop}, 2002, pp. 32-46
openalex publication_date 2003/07/24 · arxiv created 2005/03/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.