947 search results - page 22 / 190 » Provable Implementations of Security Protocols |
ENTCS
2007
14 years 11 months ago
2007
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...
89
Voted
ESORICS
2009
Springer
16 years 10 days ago
2009
Springer
In this paper, we propose a novel ID-based secure distance bounding protocol. Unlike traditional secure distance measurement protocols, our protocol is based on standard insecure d...
ESORICS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We propose a general transformation that maps a cryptographic protocol that is secure in an extremely weak sense (essentially in a model where no adversary is present) in...
ICDCS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...
103
click to vote
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...