Thumbnail
Access Restriction
Open

Author Reiter, Michael ♦ Gong, Li
Source CiteSeerX
Content type Text
Publisher IEEE Computer Society Press
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Distributed System ♦ Possible Security Goal ♦ Security Policy ♦ Present Simple Algorithm ♦ Correct Implementation ♦ Causal Relationship
Description In a distributed system, it is often important to detect the causal relationships between events, where event e 1 is causally before event e 2 if e 1 happened before e 2 and could possibly have affected the occurrence of e 2 . In this paper we argue that detecting causal relationships among events can be important for security, in the sense that it may be essential to the correct implementation of a security policy that a process be able to determine if two events are causally related, and if so, how. We formulate attacks on causality in terms of causal denial and forgery, formalize possible security goals with respect to causality, and present simple algorithms to attain these goals in some situations. 1 Introduction In a distributed system, it is often important to detect the causal relationships between events, where event e 1 is causally before event e 2 if e 1 happened before e 2 and could possibly have affected the occurrence of e 2 [9]. Causality has been recognized as fundame...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1993-01-01
Publisher Institution 1993 IEEE Symposium on Research in Security and Privacy