Skip to main content

Long-Term Secure Two-Round Group Key Establishment from Pairings

  • Conference paper
Cryptography and Security Systems (CSS 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 448))

Included in the following conference series:

Abstract

In 2007, Bohli et al. introduced the concept of long-term security as resistance against attacks even if later, after completion of the protocol some security assumptions become invalid, and proposed a three-round long-term secure two-party key establishment protocol. Building on a two-party solution of Bohli et al., we present an authenticated two-round group key establishment protocol which remains secure if either a Computational Bilinear Diffie Hellman problem is hard or a server, who shares a symmetric key with each user, is uncorrupted.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Bohli, J.-M., Müller-Quade, J., Röhrich, S.: Long-Term and Dynamical Aspects of Information Security: Emerging Trends in Information and Communication Security. In: Long-term Secure Key Establishment, pp. 87–95. Nova Science Publishers (2007)

    Google Scholar 

  2. Müller-Quade, J., Unruh, D.: Long-Term Security and Universal Composability. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 41–60. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Unruh, D.: Everlasting multi-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 380–397. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Neupane, K., Steinwandt, R.: Server-assisted Long-term Secure 3-party Key Establishment. In: SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography, pp. 372–378. SciTePress (2010)

    Google Scholar 

  5. Neupane, K., Steinwandt, R.: Communication-Efficient 2-Round Group Key Establishment from Pairings. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 65–76. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Neupane, K., Steinwandt, R., Corona, A.S.: Group Key Establishment: Adding Perfect Forward Secrecy at the Cost of One Round. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol. 7712, pp. 158–168. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. SIAM Journal of Computing 32, 586–615 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption, http://cseweb.ucsd.edu/~mihir/papers/sym-enc.html

  9. Menezes, A., Van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)

    Book  Google Scholar 

  10. Bohli, J.-M., González Vasco, M.I., Steinwandt, R.: Secure group key establishment revisited. International Journal of Information Security 6, 243–254 (2007)

    Article  Google Scholar 

  11. Katz, J., Yung, M.: Scalable Protocols for Authenticated Group Key Exchange. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 110–125. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Bresson, E., Chevassut, O., Pointcheval, D.: Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 290–309. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.-J.: Provably Authenticated Group Diffie-Hellman Key Exchange. In: Proceedings of the 8th ACM Conference on Computer and Communications Security, CCS 2001, pp. 255–264. ACM (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neupane, K. (2014). Long-Term Secure Two-Round Group Key Establishment from Pairings. In: Kotulski, Z., Księżopolski, B., Mazur, K. (eds) Cryptography and Security Systems. CSS 2014. Communications in Computer and Information Science, vol 448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44893-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44893-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44892-2

  • Online ISBN: 978-3-662-44893-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics