1777 search results - page 70 / 356 » Programming Cryptographic Protocols |
AINA
2007
IEEE
14 years 3 months ago
2007
IEEE
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic algorithms and protocols. Unfortunately, a series of res...
SP
2006
IEEE
14 years 2 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
CONCUR
2005
Springer
14 years 2 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...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...