Dynamic security analysis of group key agreement protocol

Access Full Text

Dynamic security analysis of group key agreement protocol

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

Group key agreement is a fundamental building block for increasing collaborative applications. The protocol is more complicated than peer-to-peer communication owing to its dynamic characteristics, but the research to date on group key agreement protocols (GKAP) mainly focuses on the static security and the most distinctively dynamic characteristic of GKAP is difficult to analyse by existing methods. The paper attempts to extend the strand space theory to analyse the dynamic security of GKAP. With the aid of the theory, the AT-GDH protocol is taken as an example to discuss the general conditions of the security retention in dynamic cases. A new scheme is proposed of updating the session key when some member leaves the group based on SA-GDH.2 protocol to avoid the single-point weakness.

Inspec keywords: protocols; cryptography; computer networks; telecommunication security

Other keywords: dynamic security analysis; strand space theory; peer-to-peer communication; group key agreement protocol; single-point weakness; static security; session key updating; collaborative applications; protocol

Subjects: Computer communications; Computer networks and techniques; Protocols; Data security; Protocols; Cryptography

References

    1. 1)
      • F.J. Thayer , J.H. Herzog , J. Guttman . Strand spaces: Proving security protocols correct. J. Comput. Security , 191 - 230
    2. 2)
      • Pereira, O., Quisquater, J.-J.: `A security analysis of the cliques protocols suites', Proc. 14th IEEE workshop on Computer Security Foundations, 2001, Cap Breton, Canada, p. 73–81.
    3. 3)
      • G. Ateniese , M. Steiner , G. Tsudik . New multiparty authentication services and key agreement protocols. IEEE J Sel. Areas Commun. , 4 , 628 - 639
    4. 4)
      • Bresson, E., Chevassut, O., Pointcheval, D.: `Provably authenticated group Diffe–Hellman key exchange—the dynamic case', Proc. AsiaCrypt, 2001, Gold Coast, Australia, 2248, p. 290–309, Lect. Notes Comput. Sci..
    5. 5)
      • Fabrega, F.J.T., Herzog, J.C., and Guttman, J.D., ‘Honest ideals on strand spaces’, Proc 11th IEEE workshop on Computer Security Foundations, June 1998.
    6. 6)
      • Guttman, J.D., Thayer, F.J.: `Authentication tests', Proc. IEEE Symp. on Security and Privacy, May 2000.
    7. 7)
      • Just, M., Vaudenay, S.: `Authenticated multi-party key agreement', Proc. AsiaCrypt’96 Conf., 1996, Kyongju, South Korea, 1163, p. 36–49, Lect. Notes Comput. Sci..
    8. 8)
      • Pereira, O.: ‘Modelling and security analysis of authenticated group key agreement protocols’. PhD thesis, Louvain- la-Neuve, Belgique, 2003.
    9. 9)
      • Steiner, M., Tsudik, G., Waidner, M.: `Diffie–Hellman key distribution extended to group communication', Proc. 3rd ACM Conf. on Computer and Communications Security, 1996, New Delhi, India, p. 31–37.
    10. 10)
      • Steiner, M., Tsudik, G., Waidner, M.: `CLIQUES: A new approach to group key agreement', Proc. IEEE Int. Conf. ICDCS’97, 1997, Baltimore, USA, IEEE Computer Society Press, p. 380–387.
    11. 11)
      • Bresson, E., Chevassut, O., Pointcheval, D.: `Dynamic group Diffie–Hellman key exchange under standard assumptions', Proc. Eurocrypt, 2002, Amsterdam, The Netherlands, 2332, p. 321–336, Lect. Notes Comput. Sci..
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_20045193
Loading

Related content

content/journals/10.1049/ip-com_20045193
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading