Skip to main content

Long-Term Secure One-Round Group Key Establishment from Multilinear Mappings

  • Conference paper
  • First Online:
Innovative Security Solutions for Information Technology and Communications (SECITC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10006))

Included in the following conference series:

Abstract

A new concept of security, long-term security, was introduced by Bohli et al. in 2007 as a security guarantee of a protocol even some security assumptions become invalid after the completion of the protocol. Following the notion of long-term security of Bohli et al., we present a one-round long-term secure group key establishment protocol in the random oracle model. The resulting solution is built on a multilinear map and timestamps. The protocol also offers integrity and strong entity authentication. The proposed protocol remains secure if either a server, who shares a symmetric key with each user, is uncorrupted or a Graded Decisional Diffie Hellman problem is hard.

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 EPUB and 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

References

  1. Barbosa, M., Farshim, P.: Security analysis of standard authentication and key agreement protocols utilising timestamps. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 235–253. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02384-2_15

    Chapter  Google Scholar 

  2. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption, September 2000. http://cseweb.ucsd.edu/~mihir/papers/sym-enc.html

  3. Bohli, J.-M., Müller-Quade, J., Röhrich, S.: Long-term secure key establishment. In: Schmidt, A.U., Kreutzer, M., Accorsi, R. (eds.) Long-Term and Dynamical Aspects of Information Security: Emerging Trends in Information and Communication Security, pp. 87–95. Nova Science Publishers (2007)

    Google Scholar 

  4. Bohli, J.-M., Vasco, M.I.G., Steinwandt, R.: Secure group key establishment revisited. Int. J. Inf. Secur. 6(4), 243–254 (2007)

    Article  Google Scholar 

  5. Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.-J.: Provably authenticated group Diffie-Hellman key exchange. In: Proceedings of 8th ACM Conference on Computer and Communications Security, CCS 2001, pp. 255–264. ACM (2001)

    Google Scholar 

  6. Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 476–493. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40041-4_26

    Chapter  Google Scholar 

  7. Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1–17. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38348-9_1

    Chapter  Google Scholar 

  8. 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). doi:10.1007/978-3-540-45146-4_7

    Chapter  Google Scholar 

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

    Book  MATH  Google Scholar 

  10. 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). doi:10.1007/978-3-540-70936-7_3

    Chapter  Google Scholar 

  11. Neupane, K.: Long-term secure two-round group key establishment from pairings. In: Kotulski, Z., Księżopolski, B., Mazur, K. (eds.) CSS 2014. CCIS, vol. 448, pp. 122–130. Springer, Heidelberg (2014)

    Google Scholar 

  12. Neupane, K., Steinwandt, R.: Server-assisted long-term secure 3-party key establishment. In: SECRYPT 2010 - Proceedings of International Conference on Security and Cryptography, Athens, Greece, 26–28 July 2010, pp. 372–378. SciTePress (2010)

    Google Scholar 

  13. Unruh, D.: Everlasting multi-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 380–397. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40084-1_22

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kashi Neupane .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Neupane, K. (2016). Long-Term Secure One-Round Group Key Establishment from Multilinear Mappings. In: Bica, I., Reyhanitabar, R. (eds) Innovative Security Solutions for Information Technology and Communications. SECITC 2016. Lecture Notes in Computer Science(), vol 10006. Springer, Cham. https://doi.org/10.1007/978-3-319-47238-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47238-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47237-9

  • Online ISBN: 978-3-319-47238-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics