ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 326, Issues 1-3, 20 October 2004, Pages 363-382
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (283 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2004.08.001    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Authenticated key agreement in dynamic peer groups

Xun YiCorresponding Author Contact Information, E-mail The Corresponding Author

School of Computer Science and Mathematics, Victoria University, P.O. Box 14428, Melbourne City MC, Victoria 8001, Australia

Received 26 September 2002; 
revised 13 July 2004; 
accepted 27 July 2004. 
Communicated by P. Spirakis. 
Available online 1 September 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Many group-oriented applications in distributed systems, such as teleconferencing and cooperative works, involve dynamic peer groups. In order to secure communications in dynamic peer groups, authenticated key agreement protocols are required. In this paper, we propose a new authenticated key agreement protocol, composed of a basic protocol and a dynamic protocol, for dynamic peer groups. With the basic protocol, a secret group key can be achieved in a peer group via group handshake, secret broadcast, key derivation and key confirmation phases. By the dynamic protocol, a new secret group key can be reached when member or mass join, group mergence, group division, member or mass quit occurs in a dynamic peer group. Security analysis shows that our protocol offers explicit group key authentication and prevents from both passive and active attacks. In our basic protocol, each group member equally contributes to the secret group key in parallel and guarantees key freshness.

Keywords: Group communication; Authenticated key agreement; Secret-key and public-key cryptosystems; Discrete logarithm problem


Theoretical Computer Science
Volume 326, Issues 1-3, 20 October 2004, Pages 363-382
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.