Skip Navigation

The Computer Journal 1995 38(8):633-642; doi:10.1093/comjnl/38.8.633
© 1995 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Reiter, M.
Right arrow Articles by Gong, L.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Securing Causal Relationships in Distributed Systems

M. Reiter1 and L. Gong2 *

1 AT&T Bell Laboratories, Murray Hill, New Jersey, USA, 2 SRI International, Menlo Park, California, USA

In a distributed system, it is often important to detect the causal relationships between events, where event e1 is causally before event e2 if e1 happened before e2 and could possibly have affected the occurrence of e2. In this paper we argue that it can be essential to security that a process determine, in the face of malicious attack, how two events are causally related. We formulate attacks on causality detection 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.


Received October 18 1994. revised October 19 1995.

* SRI International, Menlo Park, California, USA Email: reiter{at}research.att.com,gong{at}csl.sri.com

§ AT&T Bell Laboratories, Murray Hill, New Jersey, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.