42 search results - page 2 / 9 » A Cryptographically Sound Security Proof of the Needham-Schr... |
ACSAC
2000
IEEE
13 years 9 months ago
2000
IEEE
The widespread use of public networks, such as the Internet, for the exchange of sensitive data, like legally valid documents and business transactions, poses severe security cons...
ESORICS
2004
Springer
13 years 10 months ago
2004
Springer
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
ESAS
2004
Springer
13 years 10 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
JCS
2010
13 years 3 months ago
2010
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
IEEEARES
2008
IEEE
13 years 11 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...