ACM Transactions on Computer Systems (TOCS)
Lower bounds on messages and rounds for network authentication protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Formal Analysis of Some Properties of Kerberos 5 Using MSR
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A hybrid authentication protocol for large mobile network
Journal of Systems and Software
Password-based user authentication and key distribution protocols for client-server applications
Journal of Systems and Software
Efficient network authentication protocols: lower bounds and optimal implementations
Distributed Computing
Theoretical Computer Science - Automated reasoning for security protocol analysis
Analysing protocols subject to guessing attacks
Journal of Computer Security - Special issue on WITS'02
Communication-efficient AUTHMAC_DH protocols
Computer Standards & Interfaces
Breaking and fixing public-key Kerberos
Information and Computation
Analysing Password Protocol Security Against Off-line Dictionary Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
On the security of public key protocols
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Authentication and key distribution (AKD) protocols have become more important in the design of communication systems. The design criteria of the AKD protocols include the scalability, the communication efficiency, the computational efficiency, and the robustness of security. In this paper, we first analyze the vulnerability of an AKD protocol under the off-line guessing attack. Then, we propose an enhanced AKD protocol to overcome the vulnerability. Security analysis and formal verification by using AVISPA toolkit show that the proposed protocol can keep all the previous properties and is secure against the off-line guessing attack. Copyright © 2012 John Wiley & Sons, Ltd.