Sciweavers

719 search results - page 3 / 144
» Proving Security Protocols Correct
Sort
View
EGCDMAS
2004
147views ECommerce» more  EGCDMAS 2004»
14 years 11 months ago
Should We Prove Security Policies Correct?
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
Sebastiano Battiato, Giampaolo Bella, Salvatore Ri...
CSFW
1999
IEEE
15 years 1 months ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch
CSFW
1998
IEEE
15 years 1 months ago
Honest Ideals on Strand Spaces
In security protocol analysis, it is important to learn general principles that limit the abilities of an attacker, and that can be applied repeatedly to a variety of protocols. W...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
CSFW
1999
IEEE
15 years 1 months ago
Mixed Strand Spaces
Strand space analysis [13, 12] is a method for stating and proving correctness properties for cryptographic protocols. In this paper we apply the same method to the related proble...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 9 months ago
Automatic Verification of Correspondences for Security Protocols
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
Bruno Blanchet