227 search results - page 2 / 46 » On the Reachability Problem in Cryptographic Protocols |
72
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper investigates the suitability of applying the general-purpose Real-Time Maude tool to the formal specification and model checking analysis of timedependent cryptographi...
87
Voted
ACSAC
2003
IEEE
15 years 1 months ago
2003
IEEE
When a receiver of a ciphertext message can not decrypt the message due to the fact that he has lost his private-key, the private-key of the receiver and session-key of the messag...
79
Voted
CONCUR
2005
Springer
15 years 3 months ago
2005
Springer
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
108
click to vote
CCS
2005
ACM
15 years 3 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
94
Voted
CADE
2005
Springer
15 years 10 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...