skip to main content
10.1145/2791405.2791440acmotherconferencesArticle/Chapter ViewAbstractPublication PageswciConference Proceedingsconference-collections
research-article

Non-tree Based Group Key Management Scheme With Constant Rekeying and Storage Cost

Published: 10 August 2015 Publication History

Abstract

Designing a key management scheme for secure group communication is a challenging task. There are several tree based and non-tree based group key management schemes. In the existing non-tree based group key management schemes, the rekeying and storage costs are mostly in linear with the number of members in the group. Also, in some of the efficient tree-based group key management schemes, the rekeying and storage cost is a function of the number of group users. We propose a rekey efficient centralized group key management scheme in which communication, storage and computation costs are constant. In the proposed scheme, each user has to store only two keys. We compare the proposed scheme with some of the existing tree and non-tree based group key management schemes and show that the proposed scheme is rekey and storage efficient.

References

[1]
R. Aparna and B. B. Amberker. A key management scheme for secure group communication using binomial key trees. Int. Journal of Network Management, 20(6):383--418, 2010.
[2]
K. Becker and U. Wille. Communication complexity of group key distribution. In L. Gong and M. K. Reiter, editors, ACM Conference on Computer and Communications Security, pages 1--6. ACM, 1998.
[3]
C. Boyd. On key agreement and conference key agreement. In V. Varadharajan, J. Pieprzyk, and Y. Mu, editors, ACISP, volume 1270 of Lecture Notes in Computer Science, pages 294--302. Springer, 1997.
[4]
C.-C. Chang, L. Harn, and T.-F. Cheng. Notes on "polynomial-based key management for secure intra-group and inter-group communication". International Journal of Network Security, 16(2):143--148, 2014.
[5]
H.-H. Chu, L. Qiao, K. Nahrstedt, H. Wang, and R. Jain. A secure multicast protocol with copyright protection. Computer Communication Review, 32(2):42--60, 2002.
[6]
L. R. Dondeti, S. Mukherjee, and A. Samal. Scalable secure one-to-many group communication using dual encryption. Computer Communications, 23(17):1681--1701, 2000.
[7]
X. Du, Y. Wang, J. Ge, and Y. Wang. An id-based broadcast encryption scheme for key distribution. Broadcasting, IEEE Transactions on, 51(2):264--266, 2005.
[8]
M. Eltoweissy, M. H. Heydari, L. Morales, and I. H. Sudborough. Combinatorial optimization of group key management. Journal of Network and Systems Management, 12(1):33--50, 2004.
[9]
A. A. Kamal. Cryptanalysis of a polynomial-based key management scheme for secure group communication. I. J. Network Security, 15(1):68--70, 2013.
[10]
H. Kim, S.-m. Hong, H. Yoon, and J. W. Cho. Secure group communication with multiplicative one-way functions. In Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on, volume 1, pages 685--690. IEEE, 2005.
[11]
W.-C. Ku and S.-M. Chen. An improved key management scheme for large dynamic groups using one-way function trees. In Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on, pages 391--396. IEEE, 2003.
[12]
W. H. D. Ng, M. P. Howarth, Z. Sun, and H. S. Cruickshank. Dynamic balanced key tree management for secure multicast communications. IEEE Trans. Computers, 56(5):590--605, 2007.
[13]
R. Oppliger and A. Albanese. Distributed registration and key distribution (dirk). In S. K. Katsikas and D. Gritzalis, editors, SEC, volume 54 of IFIP Conference Proceedings, pages 199--208. Chapman & Hall, 1996.
[14]
A. N. Pour, K. Kumekawa, T. Kato, and S. Itoh. A hierarchical group key management scheme for secure multicast increasing efficiency of key distribution in leave operation. Computer Networks, 51(17):4727--4743, 2007.
[15]
S. Rafaeli and D. Hutchison. Hydra: A decentralised group key management. In WETICE, pages 62--67. IEEE Computer Society, 2002.
[16]
A. T. Sherman and D. A. McGrew. Key establishment in large dynamic groups using one-way function trees. IEEE Trans. Software Eng., 29(5):444--458, 2003.
[17]
R. Srinivasan, V. Vaidehi, R. Rajaraman, S. Kanagaraj, R. C. Kalimuthu, and R. Dharmaraj. Secure group key management scheme for multicast networks. I. J. Network Security, 10(3):205--209, 2010.
[18]
M. Steiner, G. Tsudik, and M. Waidner. Diffie-hellman key distribution extended to group communication. In L. Gong and J. Stearn, editors, ACM Conference on Computer and Communications Security, pages 31--37. ACM, 1996.
[19]
S. Tang, J. Ding, and Y. Liang. A simple and efficient new group key management approach based on linear geometry. IACR Cryptology ePrint Archive, 2011:225, 2011.
[20]
M. Waldvogel, G. Caronni, D. Sun, N. Weiler, and B. Plattner. The versakey framework: versatile group key management. IEEE Journal on Selected Areas in Communications, 17(9):1614--1631, 1999.
[21]
C. K. Wong, M. G. Gouda, and S. S. Lam. Secure group communications using key graphs. IEEE/ACM Trans. Netw., 8(1):16--30, 2000.
[22]
P. Yanji, J. Kim, U. Tariq, and M. Hong. Polynomial-based key management for secure intra-group and inter-group communication. Computers & Mathematics with Applications, 65(9):1300--1309, 2013.
[23]
J. Zhang, V. Varadharajan, and Y. Mu. A novel dynamic key management scheme for secure multicasting. In ICON'03, pages 391--395, 2003.
[24]
Z. Zhou and D. Huang. Bgkm: An efficient secure broadcasting group key management scheme. IACR Cryptology ePrint Archive, 2008:436, 2008.
[25]
X. Zou, Y. Dai, and E. Bertino. A practical and flexible key management mechanism for trusted collaborative computing. In INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pages 538--546. IEEE, 2008.
[26]
X. Zou, Y. Karandikar, and E. Bertino. A dynamic key management solution to access hierarchy. Int. Journal of Network Management, 17(6):437--450, 2007.
[27]
X. Zou, B. Ramamurthy, and S. S. Magliveras. Secure Group Communications Over Data Networks. Springer, 2004. ISBN: 0387229701.

Cited By

View all
  • (2023)A lightweight group key management scheme with constant rekeying cost and public bulletin sizeInformation Security Journal: A Global Perspective10.1080/19393555.2023.219873733:2(97-120)Online publication date: 21-Apr-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
WCI '15: Proceedings of the Third International Symposium on Women in Computing and Informatics
August 2015
763 pages
ISBN:9781450333610
DOI:10.1145/2791405
© 2015 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2015

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Broadcast
  2. Group communication
  3. Key management
  4. Rekey Efficient

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

WCI '15

Acceptance Rates

WCI '15 Paper Acceptance Rate 98 of 452 submissions, 22%;
Overall Acceptance Rate 98 of 452 submissions, 22%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)A lightweight group key management scheme with constant rekeying cost and public bulletin sizeInformation Security Journal: A Global Perspective10.1080/19393555.2023.219873733:2(97-120)Online publication date: 21-Apr-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media