Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security and Cryptology

Inscrypt 2010: Information Security and Cryptology pp 236–254Cite as

Redesigning Group Key Exchange Protocol Based on Bilinear Pairing Suitable for Various Environments

  • Conference paper

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

Abstract

Group key exchange (GKE) allows a group of n parties to share a common secret key over insecure channels. Since key management is important, NIST is now looking for a standard. The goal of this paper is to redesign GKE using bilinear pairings, proposed by Desmedt and Lange, from the point of view of arrangement of parties. The arrangement of parties is called a party tree in this paper. Actually, we are able to redesign the party tree, to reduce the computational and communicational complexity compared with the previous scheme, when GKE is executed among a small group of parties. We also redesign the general party tree for a large number of parties, in which each party is in a different environment such as having large or limited computational resources, electrical power, etc.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dutta, R., Barua, R.: Dynamic Group Key Agreement in Tree-Based Setting. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 101–112. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Barua, R., Dutta, R., Sarkar, P.: Extending Joux’s Protocol to Multi Party Key Agreement. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 205–217. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Dutta, R., Barua, R., Sarkar, P.: Provably Secure Authenticated Tree Based Group Key Agreement. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 92–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Berge, C.: Graphs and Hypergraphs. Elsevier Science (1985)

    Google Scholar 

  5. Abdel-Hafez, A., Miri, A., Orozco-Barbosa, L.: Authenticated group key agreement protocols for ad hoc wireless networks. Journal of Network Security (2007)

    Google Scholar 

  6. Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptology 21(2), 149–177 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Burmester, M., Desmedt, Y.G.: 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 

  8. 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)

    Chapter  Google Scholar 

  9. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Choi, K.Y., Hwang, J.Y., Lee, D.-H.: Efficient ID-based group key agreement with bilinear maps. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 130–144. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Ciet, M., Joye, M., Lauter, K., Montgomey, P.L.: Trading inversions for multiplications in elliptic curve cryptography. In: Designs, Codes and Cryptography, vol. 39(2), pp. 189–206. Springer, Netherlands (2006)

    Google Scholar 

  12. Desmedt, Y., Lange, T.: Revisiting pairing based group key exchange. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 53–68. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Desmedt, Y., Lange, T., Burmester, M.: Scalable authenticated tree based group key exchange for ad-hoc groups. In: Dietrich, S., Dhamija, R. (eds.) FC 2007 and USEC 2007. LNCS, vol. 4886, pp. 104–118. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. J. Cryptology 17(4), 263–276 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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 

  16. Knuth, D.E.: The Art of Computer Programming. In: Seminumerical Algorithms, 2nd edn., vol. 2. Addison-Wesley, Reading (1981)

    Google Scholar 

  17. Konstantinou, E.: Cluster-based group key agreement for wireless ad hoc networks. in: ARES 2008 (2008)

    Google Scholar 

  18. Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of Elliptic Curve Traces under FR-reduction. IEICE Trans. Fundamentals E84-A(5), 1234–1243 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University College London and RCIS (AIST), UK

    Yvo Desmedt

  2. Japan Advanced Institute of Science and Technology, Japan

    Atsuko Miyaji

Authors
  1. Yvo Desmedt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atsuko Miyaji
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiaotong University, Dongchuan Road 800, 200240, Shanghai, China

    Xuejia Lai

  2. Columbia University, USA

    Moti Yung

  3. State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China

    Dongdai Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Desmedt, Y., Miyaji, A. (2011). Redesigning Group Key Exchange Protocol Based on Bilinear Pairing Suitable for Various Environments. In: Lai, X., Yung, M., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2010. Lecture Notes in Computer Science, vol 6584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21518-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21518-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21517-9

  • Online ISBN: 978-3-642-21518-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation