20 search results - page 4 / 4 » Breaking One-Round Key-Agreement Protocols in the Random Ora... |
WCC
2005
Springer
13 years 10 months ago
2005
Springer
A secret handshake mechanism allows two entities, members of a same group, to authenticate each other secretly. This primitive was introduced recently by Balfanz, Durfee, Shankar, ...
DRM
2003
Springer
13 years 10 months ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
ESORICS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
PKC
2007
Springer
13 years 11 months ago
2007
Springer
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...