5665 search results - page 801 / 1133 » Introduction to Computer Security |
178
click to vote
ACSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
180
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
214
click to vote
EUROPKI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Key agreement protocols are a fundamental building block for ensuring authenticated and private communications between two parties over an insecure network. This paper fo...
179
click to vote
FC
2006
Springer
15 years 10 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
148
click to vote
ACSAC
2001
IEEE
15 years 10 months ago
2001
IEEE
Distributed Denial of Service (DDoS) attacks exploit the acute imbalance between client and server workloads to cause devastation to the service providers. We propose a distribute...