256 search results - page 5 / 52 » Reusing Static Keys in Key Agreement Protocols |
84
Voted
IPL
2006
14 years 11 months ago
2006
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation. We show that to...
STOC
2005
ACM
15 years 12 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
107
click to vote
COMPSEC
2006
14 years 11 months ago
2006
Anonymity is a desirable security feature in addition to providing user identification and key agreement during a user's login process. Recently, Yang et al., proposed an eff...
95
Voted
IACR
2011
13 years 11 months ago
2011
Abstract—In this work we consider two protocols for performing cryptanalysis and security enhancement. The first one by Song, is a password authentication scheme based on smart ...
AINA
2005
IEEE
15 years 5 months ago
2005
IEEE
In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on ...