Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Privacy Protection for Transactions of Digital Goods
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Fast Key Exchange with Elliptic Curve Systems
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Security weakness in a three-party pairing-based protocol for password authenticated key exchange
Information Sciences: an International Journal
EC2C-PAKA: An efficient client-to-client password-authenticated key agreement
Information Sciences: an International Journal
Authenticated multiple key exchange protocols based on elliptic curves and bilinear pairings
Computers and Electrical Engineering
SSL/TLS session-aware user authentication - Or how to effectively thwart the man-in-the-middle
Computer Communications
A new security protocol based on elliptic curve cryptosystems for securing wireless sensor networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Efficient user authentication and key agreement in ubiquitous computing
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
New directions in cryptography
IEEE Transactions on Information Theory
An Efficient Authentication Scheme for Telecare Medicine Information Systems
Journal of Medical Systems
An Improved Authentication Scheme for Telecare Medicine Information Systems
Journal of Medical Systems
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
| Hi-index | 0.00 |
Many authentication and key agreement protocols were proposed for protecting communicated messages. In previous protocols, if the user@?s identity is transmitted in plaintext, an adversary can tap the communications and employ it to launch some attacks. In most protocols with user anonymity, they focus on satisfaction of several security requirements. From a client@?s point of view, those protocols are not admired since the cost of storage, computation and communication is high. In pervasive computing, a client usually uses a limited-resource device to access multiple servers. The storage and computation are very important issues especially in this kind of environments. Also, for a convenience of designing protocol, most protocols use timestamps to prevent the replay attack. As we know, the serious time synchronization problem exists in timestamp-based protocols. Finally, most protocols do not have formal proofs for the security. In this paper, we propose a secure and efficient identification and key agreement protocol with user anonymity based on the difficulty of cracking the elliptic curve Diffie-Hellman assumption. In addition, we also propose an augmented protocol for providing the explicit mutual authentication. Compared with the related protocols, the proposed protocols@? computation cost is lower and the key length is shorter. Therefore, our protocols are suitable even for applications in low power computing environments. Finally, we formally prove the security of the proposed protocols by employing the random oracle model.