227 search results - page 5 / 46 » On the Reachability Problem in Cryptographic Protocols |
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
MA
2001
Springer
13 years 12 months ago
2001
Springer
Mobile agent security is still a young discipline and most naturally, the focus up to the time of writing was on inventing new cryptographic protocols for securing various aspects ...
ESORICS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Cryptographic protocols are useful for engineering trust in transactions. There are several languages for describing these protocols, but these tend to capture the commun...
IJNSEC
2008
13 years 7 months ago
2008
Recently non-abelian groups have attracted the attention of cryptographers for constructing public-key cryptographic protocols. In this paper we use the conjugacy problem in non-a...