Sciweavers

554 search results - page 7 / 111
» Verifying Security Protocols Modelled by Networks of Automat...
Sort
View
ACSAC
2005
IEEE
14 years 1 months ago
Verify Results of Network Intrusion Alerts Using Lightweight Protocol Analysis
We propose a method to verify the result of attacks detected by signature-based network intrusion detection systems using lightweight protocol analysis. The observation is that ne...
Jingmin Zhou, Adam J. Carlson, Matt Bishop
AINA
2006
IEEE
13 years 11 months ago
Efficient Authentication for Reactive Routing Protocols
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...
Raghav Bhaskar, Javier Herranz, Fabien Laguillaumi...
CCS
2008
ACM
13 years 9 months ago
Cryptographically verified implementations for TLS
We intend to narrow the gap between concrete implementations of cryptographic protocols and their verified models. We develop and verify a small functional implementation of the T...
Karthikeyan Bhargavan, Cédric Fournet, Rica...
AINA
2006
IEEE
14 years 1 months ago
Property-Based Taming of Lying Mobile Nodes
Intelligent security protocols can verify whether the involved principals have properties that are defined based on certain functional and security policies. The property we focu...
Mark Manulis, Ahmad-Reza Sadeghi
FORMATS
2004
Springer
14 years 1 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...