70 search results - page 13 / 14 » Provably authenticated group Diffie-Hellman key exchange |
ACNS
2008
Springer
13 years 9 months ago
2008
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
CCS
2009
ACM
14 years 7 months ago
2009
ACM
In wireless roaming a mobile device obtains a service from some foreign network while being registered for the similar service at its own home network. However, recent proposals tr...
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
EUROCRYPT
2005
Springer
14 years 12 days ago
2005
Springer
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
NDSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Although several wide-spread internet applications (e.g., job-referral services, dating services) can benefit from online matchmaking, protocols defined over the past two decade...