127 search results - page 5 / 26 » Proving Properties of Security Protocols by Induction |
CSFW
1998
IEEE
15 years 1 months ago
1998
IEEE
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...
IANDC
2008
14 years 9 months ago
2008
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
163
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
CSFW
2006
IEEE
15 years 3 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
78
Voted
CCS
2006
ACM
15 years 1 months ago
2006
ACM
We present a process algebraic intruder model for verifying a class of liveness properties of security protocols. For this class, the proposed intruder model is proved to be equiv...