Sciweavers

137 search results - page 6 / 28
» Automated Reasoning for Security Protocol Analysis
Sort
View
FC
2010
Springer
169views Cryptology» more  FC 2010»
13 years 10 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
ENTCS
2006
145views more  ENTCS 2006»
13 years 7 months ago
Compositionality of Security Protocols: A Research Agenda
The application of formal methods to security protocol analysis has been extensively researched during the last 25 years. Several formalisms and (semi-)automatic tools for the ver...
Cas J. F. Cremers
CADE
2011
Springer
12 years 7 months ago
ASASP: Automated Symbolic Analysis of Security Policies
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
Francesco Alberti, Alessandro Armando, Silvio Rani...
IANDC
2008
120views more  IANDC 2008»
13 years 7 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
CSFW
2007
IEEE
14 years 1 months ago
Reasoning about Concurrency for Security Tunnels
There has been excellent progress on languages for rigorously describing key exchange protocols and techniques for proving that the network security tunnels they establish preserv...
Alwyn Goodloe, Carl A. Gunter