Skip to main content

Automatic Security Analysis for Group Key Exchange Protocol: A Case Study in Burmester-Desmedt Protocol

  • Conference paper
  • First Online:
Advances in Control and Communication

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 137))

  • 2393 Accesses

Abstract

Canetti and Herzog have already proposed universally composable symbolic analysis (UCSA) for mutual authentication and key exchange protocols automatically without sacrificing the soundness of the cryptography. We want to extend their work to analyze group key exchange protocols. This paper takes the case of BD protocol with arbitrary participants against passive adversary (BD-Passive), and proves that BD-Passive is a secure group key exchange protocol. More specially, we (1) define the ideal functionality of BD-Passive; (2) prove the security property of BD-Passive in UC security framework by UCSA. Obviously, our work plays a new approach to prove group key exchange protocols automatically without sacrificing the soundness of the cryptography.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Syposium on Foundations of Computer Science, pp. 136–145. IEEE Computer Society (2001)

    Google Scholar 

  2. Canetti, R., Herzog, J.: Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 380–403. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Burmester, M., Desmedt, Y.: A Secure and Efficient Conference Key Distribution System. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275–286. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  4. Burmester, M., Desmedt, Y.: Efficient and secure conference key distribution. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol. 1189, pp. 119–130. Springer, Heidelberg (1997)

    Google Scholar 

  5. Burmester, M., Desmedt, Y.: A secure and scalable group key exchange system. Information Processing Letters 94(3), 137–143 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chunyang, R., Hongyuan, W., Zijian, Z., Lejian, L. (2012). Automatic Security Analysis for Group Key Exchange Protocol: A Case Study in Burmester-Desmedt Protocol. In: Zeng, D. (eds) Advances in Control and Communication. Lecture Notes in Electrical Engineering, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-26007-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-26007-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-26006-3

  • Online ISBN: 978-3-642-26007-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics