127 search results - page 7 / 26 » Proving Properties of Security Protocols by Induction |
78
Voted
IPL
2006
14 years 9 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
ACNS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Untraceability and unreuseability are essential security properties for electronic cash protocols. Many protocols have been proposed to meet these two properties. However...
ENTCS
2007
14 years 9 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...
CSFW
2005
IEEE
15 years 3 months ago
2005
IEEE
Authentication and secrecy properties are proved by very different methods: the former by local reasoning, leading to matching knowledge of all principals about the order of their...
116
click to vote
CSFW
2009
IEEE
15 years 4 months ago
2009
IEEE
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...