论文信息 - A class of flexible and efficient key management protocols

A class of flexible and efficient key management protocols

Cryptographic protocols for key establishment normally include some means to allow participants to ensure that a key is new and not replayed from an old protocol run. When the key is generated by a mutually trusted server this is usually achieved by sending with the key a quantity known to be new. A different general method for achieving freshness in this content is proposed. A number of specific example protocols are given which have some practical advantages over previous published protocols.

Colin Boyd

[1] Colin Boyd,et al. Designing Secure Key Exchange Protocols , 1994, ESORICS.

[2] N. S. Barnett,et al. Private communication , 1969 .

[3] L. Gong,et al. Using one-way functions for authentication , 1989, CCRV.

[4] Josef Pieprzyk,et al. Keyed Hash Functions , 1995, Cryptography: Policy and Algorithms.

[5] Steve Kent,et al. Privacy Enhancement for Internet Electronic Mail: Part II: Certificate-Based Key Management , 1989, RFC.

[6] Colin Boyd. A Framework for Design of Key Establishment Protocols , 1996, ACISP.

[7] Steven M. Bellovin,et al. Encrypted key exchange: password-based protocols secure against dictionary attacks , 1992, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy.

[8] Randy Chow,et al. An efficient and secure authentication protocol using uncertified keys , 1995, OPSR.

[9] Gene Tsudik,et al. Refinement and extension of encrypted key exchange , 1995, OPSR.

[10] Jürgen Schönwälder,et al. A nonce-based protocol for multiple authentications , 1992, OPSR.

[11] Rainer A. Rueppel,et al. Modern key agreement techniques , 1994, Comput. Commun..

[12] John Linn,et al. Privacy enhancement for Internet electronic mail: Part II - certificate-based key management , 1987, RFC.