Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Public-key cryptography and password protocols
ACM Transactions on Information and System Security (TISSEC)
Elliptic Curve Based Password Authenticated Key Exchange Protocols
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Validation of Elliptic Curve Public Keys
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Authenticated key exchange secure against dictionary attacks
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Hi-index | 0.00 |
When we consider wireless security, it is strongly preferable to use password-based authentication and the elliptic curve based Diffie-Hellman protocol since the former provides a user-friendly authentication method and the latter is an efficient key agreement protocol. However, this combination does not necessarily guarantee security against off-line dictionary attacks (especially, "partition attacks"). In this paper, we propose an elliptic curve based authenticated key agreement (called EC-AKA) protocol that is secure against partition attacks as well as suitable for the following situation: (1) a client, who communicates with many different servers, remembers only one password and has insecure devices; (2) the counterpart servers are not perfectly secure against several attacks; (3) neither PKI (Public Key Infrastructures) nor TRM (Tamper-Resistance Modules) is available. The EC-AKAprotocol is secure under the elliptic curve Diffie-Hellman problem in the random oracle model. We also show that the EC-AKAprotocol achieves more strengthened security properties and efficiency compared with the existing protocols (employed in the IEEE 802.1x).