Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Authentication and authenticated key exchanges
Designs, Codes and Cryptography
Lower bounds on messages and rounds for network authentication protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Limitations of the Kerberos authentication system
ACM SIGCOMM Computer Communication Review
Handbook of Applied Cryptography
Handbook of Applied Cryptography
An Efficient Protocol for Authenticated Key Agreement
Designs, Codes and Cryptography
Systematic Design of Two-Party Authentication Protocols
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Smart Card Handbook
Security proofs for an efficient password-based key exchange
Proceedings of the 10th ACM conference on Computer and communications security
A Practical Password-Based Two-Server Authentication and Key Exchange System
IEEE Transactions on Dependable and Secure Computing
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Security design for three-party encrypted key exchange protocol using smart cards
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Enhanced Three-Round Smart Card-Based Key Exchange Protocol
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
A New Approach for Anonymous Password Authentication
ACSAC '09 Proceedings of the 2009 Annual Computer Security Applications Conference
3PSA: 3-Party Smart Card-Based Authentication Scheme
ICICIC '09 Proceedings of the 2009 Fourth International Conference on Innovative Computing, Information and Control
Token-based authenticated key establishment protocols for three-party communication
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Password-Based authenticated key exchange in the three-party setting
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
New directions in cryptography
IEEE Transactions on Information Theory
Efficient three-party key exchange using smart cards
IEEE Transactions on Consumer Electronics
| Hi-index | 0.00 |
Authenticated key agreement protocol is a useful cryptographic primitive, which can be used to protect the confidentiality, integrity and authenticity for transmitted data over insecure networks. From the point of view of the management of pre-shared secrets, one of the advantages of three-party authenticated key agreement (3PAKA) protocols is that they are more suitable for use in a network with large numbers of users compared with two-party authenticated key agreement protocols. Using smart cards is a practical, secure measure to protect the secret private keys of a user. Recently, some 3PAKA protocols using smart cards have been proposed. However, up to now, it is still a challenging problem to propose a 3PAKA protocol using smart cards with fewer rounds of messages and without using timestamp technique. Another important fact to be mentioned is that existing 3PAKA protocols using smart cards all lack provable-security guarantees. In this paper, we propose a new 3PAKA protocol using smart cards. The proposed protocol gains several advantages over existing related protocols: (1) The protocol is provably secure under the computational Diffie-Hellman assumption in the random oracle model, and hence can resist strong adversaries in network scenarios; (2) The protocol needs fewer rounds of messages, and can enable short communication latency and rapid response; and (3) The protocol is not based on timestamp technique, and does not need the complicated clock synchronization.