ACM Home Page
Please provide us with feedback. Feedback
The insider threat in scalable distributed systems: algorithms, metrics and gaps
Full text PdfPdf (134 KB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 2007 ACM workshop on Scalable trusted computing table of contents
Alexandria, Virginia, USA
SESSION: Invited talk II table of contents
Pages: 49 - 49  
Year of Publication: 2007
ISBN:978-1-59593-888-6
Author
Yair Amirs  Johns Hopkins University
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 42,   Citation Count: 0
Additional Information:

abstract   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1314354.1314366
What is a DOI?

ABSTRACT

However well we protect our systems, there is always a chancethey will be compromised. Constructing practical survivable distributed systems that achieve their goals even after being penetrated is a challenge. The problem manifests itself in algorithms maintaining consistency among servers, in routing protocols, and in the interface between clients (or sensors) and the system.

We discuss our recent work on intrusion-tolerant algorithms that scale to wide-area networks. We demonstrate limitations in traditional correctness criteria and in common metrics that, while relevant to small systems, are less meaningful in large and complex environments. We propose new metrics that may better capture the challenge posed by such environments. We also point to gaps where no adequate solutions currently exist.