Cryptographic protocols for authentication and key exchange are necessary for secure communications. Most protocols have assumed that a strong secret for authentication should be shared between communicating participants in the light of a threat of dictionary attacks. But a user-chosen weak secret, i.e. password, is typically used for authentication. Since most users want to use an easily memorizable password, which tends to be easy to guess, several authentication protocols that protect such a weak secret from password guessing attacks, have been developed. However, those security-oriented protocols are more expensive in terms of the number of random numbers, cipher operations, and protocol steps than the previous protocols which are not resistant to guessing attacks. We propose new authentication and key exchange protocols, which are efficient considerably in protecting a poorly-chosen weak secret from guessing attacks.
|Number of pages||8|
|Journal||Conference on Local Computer Networks|
|Publication status||Published - 1997|
|Event||Proceedings of the 1997 22nd Conference on Local Computer Networks, LCN - Minneapolis, MN, USA|
Duration: 1997 Nov 2 → 1997 Nov 5
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering