ACM SIGOPS Operating Systems Review
Efficient and timely mutual authentication
ACM SIGOPS Operating Systems Review
Using one-way functions for authentication
ACM SIGCOMM Computer Communication Review
A security risk of depending on synchronized clocks
ACM SIGOPS Operating Systems Review
A nonce-based protocol for multiple authentications
ACM SIGOPS Operating Systems Review
A note on the use of timestamps as nonces
ACM SIGOPS Operating Systems Review
Lower bounds on messages and rounds for network authentication protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Optimality of multi-domain protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
New protocols for third-party-based authentication and secure broadcast
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Secure communication using remote procedure calls
ACM Transactions on Computer Systems (TOCS)
Timestamps in key distribution protocols
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Optimal authentication protocols resistant to password guessing attacks
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Efficient protocols secure against guessing and replay attacks
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Prudent Engineering Practice for Cryptographic Protocols
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Optimal efficiency of optimistic contract signing
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Comparing lower bounds on messages and rounds for two classes of key establishment protocols
ACM SIGCOMM Computer Communication Review
Clarifying straight replays and forced delays
ACM SIGOPS Operating Systems Review
Public-key cryptography and password protocols: the multi-user case
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Efficient, DoS-resistant, secure key exchange for internet protocols
Proceedings of the 9th ACM conference on Computer and communications security
A Class of Flexible and Efficient Key Management Protocols
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Just fast keying: Key agreement in a hostile internet
ACM Transactions on Information and System Security (TISSEC)
Provably Secure Three-Party Authenticated Quantum Key Distribution Protocols
IEEE Transactions on Dependable and Secure Computing
Communication-efficient AUTHMAC_DH protocols
Computer Standards & Interfaces
Synthesising Efficient and Effective Security Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
Simple password-based three-party authenticated key exchange without server public keys
Information Sciences: an International Journal
Provably secure and efficient authentication techniques for the global mobility network
Journal of Systems and Software
An optimized two factor authenticated key exchange protocol in PWLANs
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Security enhancement of the communication-efficient AUTHMAC_DH protocols
Security and Communication Networks
| Hi-index | 0.00 |
Research in authentication protocols has focused largely on developing and analyzing protocols that are secure against certain types of attacks. There is little and only scattered discussion on protocol efficiency. This paper presents results on the lower bounds on the numbers of messages, rounds, and encryptions required for network authentication. For each proven lower bound, an authentication protocol achieving the bound is also given, thus proving that the bound is a tight bound if the given optimal protocol is secure. Moreover, we give impossibility results of obtaining protocols that are simultaneously optimal with respect to the numbers of messages and rounds.