Skip to main content

Multigroup Rekeying for a Wireless Network

  • Conference paper
Network-Based Information Systems (NBiS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4658))

Included in the following conference series:

  • 791 Accesses

Abstract

In the context of secure group communication, a shared secret key is generated anew for data protection whenever group membership changes. This paper presents an approach to fast rekeying in a wireless network that is subject to time-varying channel conditions. We address a scenario where a station joins one group at a time, but may leave multiple groups at once for abrupt link failure or cascading application termination. In our architecture, each station is assigned a private number and a code, so as to exploit Fermat’s Little Theorem and an orthogonal coding methodology, respectively. The former is used to protect the delivery of updated group keys, while the latter to encode keying material meant for different sites in an aggregate form as a payload for message distribution. Since rekeying messages are delivered via multicast, intended stations can decode information of interest at the same time. Therefore rekeying among multiple groups can still be carried out timely with O(1) message complexity. Our design provides a complementary facility to current schemes for performance improvement. Pragmatic considerations of our approach are discussed as well.

This work was supported by the National Science Council, ROC, under grants NSC 95-2221-E-224-016-MY2 and NSC 95-2622-E-150-035-CC3, and by the Ministry of Economics, ROC, under the grant 6301XS2430.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aboba, B., Blunk, L., Vollbrecht, J., Carlson, J., Levkowetz, H.: Extensible Authentication Protocol (EAP), RFC 3748, IETF Network Working Group (2004)

    Google Scholar 

  2. Amir, Y., Kim, Y., Nita-Rotaru, C., Schultz, J., Stanton, J., Tsudik, G.: Secure group communication using robust contributory key agreement. IEEE Trans. Parallel and Distributed Syst. 15, 468–480 (2004)

    Article  Google Scholar 

  3. Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and some efficient constructions. In: Proc. 18th Ann. Joint Conf. IEEE Comp. and Comm. Societies, vol. 2, pp. 708–716. IEEE, Los Alamitos (1999)

    Google Scholar 

  4. Chang, I., Engel, R., Kandlur, D., Pendarakis, D., Saha, D.: Key management for secure Internet multicast using boolean function minimization techniques. In: Proc. 18th Ann. Joint Conf. IEEE Comp. and Comm. Societies, vol. 2, pp. 689–698. IEEE, Los Alamitos (1999)

    Google Scholar 

  5. Eronen, P.(ed.), Hiller, T., Zorn, G.: Diameter Extensible Authentication Protocol (EAP) application, RFC 4072, IETF Network Working Group (2005)

    Google Scholar 

  6. IEEE Std 802.11i, IEEE Standard for Telecommunications and Information Exchange between Systems—LAN/MAN Specific Requirements—Part 11: Wireless Medium Access Control (MAC) and Physical layer (PHY) specifications. Amendment 6: Medium Access Control (MAC) security enhancements (2004)

    Google Scholar 

  7. Kim, Y.: Group key agreement—theory and practice, Ph.D. Thesis, Department of Computer Science, University of Southern California, USA (2002)

    Google Scholar 

  8. Kim, H., Hong, S.-M., Yoon, H., Cho, J.W.: Secure group communication with multiplicative one-way functions. In: Proc. Int’l Conf. Info. Technology, pp. 685–690 (2005)

    Google Scholar 

  9. Li, X.S., Yang, Y.R., Gouda, M., Lam, S.S.: Batch rekeying for secure group communications. In: Proc. Int’l World Wide Web Conf., pp. 525–534 (2001)

    Google Scholar 

  10. Mittra, S.: Iolus: A framework for scalable secure multicasting. In: Proc. ACM Conf. Applications, Technologies, Architectures, and Protocols for Computer Commun., pp. 277–288. ACM, New York (1997)

    Chapter  Google Scholar 

  11. Moharrum, M., Mukkamala, R., Eltoweissy, M.: Efficient secure multicast with well-populated multicast Key trees. In: Proc. 10th Int’l Conf. Parallel and Distributed Systems, pp. 215–222 (2004)

    Google Scholar 

  12. Rigney, C., Willens, S., Rubens, A., Simpson, W.: Remote Authentication Dial-In User Service (RADIUS), RFC 2865, IETF Network Working Group (2000)

    Google Scholar 

  13. Steiner, M., Tsudik, G., Waidner, M.: CLIQUES: A new approach to group key agreement. In: Proc. 18th Int’l Conf. Distributed Computing Syst. pp. 380–387 (1998)

    Google Scholar 

  14. Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Trans. Networking 8, 16–30 (2000)

    Article  Google Scholar 

  15. Yang, C., Li, C.: Access control in a hierarchy using one-way hash functions. Computers & Security 23, 659–664 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tomoya Enokido Leonard Barolli Makoto Takizawa

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chi, KH., Jiang, JH., Hsu, YC. (2007). Multigroup Rekeying for a Wireless Network. In: Enokido, T., Barolli, L., Takizawa, M. (eds) Network-Based Information Systems. NBiS 2007. Lecture Notes in Computer Science, vol 4658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74573-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74573-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74572-3

  • Online ISBN: 978-3-540-74573-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics