Sciweavers

286 search results - page 13 / 58
» Pitfalls in Formal Reasoning about Security Protocols
Sort
View
ESORICS
2008
Springer
14 years 11 months ago
State Space Reduction in the Maude-NRL Protocol Analyzer
The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different ...
Santiago Escobar, Catherine Meadows, José M...
86
Voted
CSFW
2002
IEEE
15 years 2 months ago
A Formal Analysis of Some Properties of Kerberos 5 Using MSR
We formalize aspects of the Kerberos 5 authentication protocol in the Multi-Set Rewriting formalism (MSR) on two levels of detail. The more detailed formalization reflects the in...
Frederick Butler, Iliano Cervesato, Aaron D. Jagga...
LPAR
2005
Springer
15 years 3 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...
PADL
2012
Springer
13 years 5 months ago
Recent Advances in Declarative Networking
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
Boon Thau Loo, Harjot Gill, Changbin Liu, Yun Mao,...
ENTCS
2007
129views more  ENTCS 2007»
14 years 9 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...