{"title":"Bit Model Based Key Management Scheme for Secure Group Communication","authors":"R. Varalakshmi","volume":105,"journal":"International Journal of Computer and Information Engineering","pagesStart":2107,"pagesEnd":2112,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/10003002","abstract":"
For the last decade, researchers have started to focus
\r\ntheir interest on Multicast Group Key Management Framework. The
\r\ncentral research challenge is secure and efficient group key
\r\ndistribution. The present paper is based on the Bit model based
\r\nSecure Multicast Group key distribution scheme using the most
\r\npopular absolute encoder output type code named Gray Code. The
\r\nfocus is of two folds. The first fold deals with the reduction of
\r\ncomputation complexity which is achieved in our scheme by
\r\nperforming fewer multiplication operations during the key updating
\r\nprocess. To optimize the number of multiplication operations, an
\r\nO(1) time algorithm to multiply two N-bit binary numbers which
\r\ncould be used in an N x N bit-model of reconfigurable mesh is used
\r\nin this proposed work. The second fold aims at reducing the amount
\r\nof information stored in the Group Center and group members while
\r\nperforming the update operation in the key content. Comparative
\r\nanalysis to illustrate the performance of various key distribution
\r\nschemes is shown in this paper and it has been observed that this
\r\nproposed algorithm reduces the computation and storage complexity
\r\nsignificantly. Our proposed algorithm is suitable for high
\r\nperformance computing environment.<\/p>\r\n","references":"[1] Wallner, D. M., Harder, E. J., & Agee, R. C. (1997). \u201cKey management\r\nfor multicast: issues and architectures. Informational RFC, draft-\r\nWallnerkey-arch-ootxt, July 1997.\r\n[2] Chang, I., Engel, R., Kandlur, D., Pendarakis, D., & Daha, D. (1999).\r\n\u201cKey management for secure internet multicast using Boolean function\r\nminimization technique\u201d. In ACM SIGCOMM\u2019 99, March 1999. [3] Varalakshmi, R., & Uthariaraj, V. R. (2011). \u201cA new secure multicast\r\ngroup key management using gray code\u201d,IEEE-Xplore\r\n[4] Li, M., Poovendran, R., & McGrew, D. A. (2004). \u201cMinimizing center\r\nkey storage in hybrid one-way function based group key management\r\nwith communication constraints\u201d. Information Processing Letters, 93,\r\n191\u2013198.\r\n[5] Poovendran, R., & Baras, J. S. (2001). \u201cAn information-theoretic\r\napproach for design and analysis of rooted-tree-based multicast key\r\nmanagement schemes\u201d. IEEE Transactions on Information Theory, 47,\r\n2824\u20132834.\r\n[6] Kulkarni, S. S., & Bruhadeshwar, B. (2010). \u201cKey-update distribution in\r\nsecure group communication\u201d. Computer Communications, 33(6), 689\u2013\r\n705.\r\n[7] Bruhadeshwar, B., Kothapalli, K., & Deepya, M. S. (2009). \u201cReducing\r\nthe cost of session key establishment.\u201d In ARES (2009),pp. 369\u2013373.\r\n[8] Bruhadeshwar, B., Kothapalli, K., Poornima, M., & Divya, M. (2009).\r\n\u201cRouting protocol security using symmetric key based Techniques\u201d. In\r\nARES (2009), pp. 193\u2013200.\r\n[9] Wang, S.-J., Tsai, Y.-R., Shen, C.-C., & Chen, P.-Y. (2010).\r\n\u201cHierarchical key derivation scheme for group-oriented communication\r\nsystems\u201d. International Journal of Information Technology,\r\nCommunications and Convergence, 1(1), 66\u201376.\r\n[10] Imani, M., Taheri, M., & Naderi, M. (2010). \u201cSecurity enhanced routing\r\nprotocol for ad hoc networks\u201d. Journal of Convergence, 1(1), 43\u201348.\r\n[11] Wong, C., Gouda, M., & Lam, S. (2002). \u201cSecure group\r\ncommunications using key graphs\u201d. IEEE\/ACM Transactions on\r\nNetworking, 8, 16\u201330.\r\n[12] Blaum, M., Bruck, J., & Vardy, A. (1996). \u201cMDS array codes with\r\nindependent parity symbols\u201d. IEEE Transactions on Information Theory,\r\n42(2), 529\u2013542.\r\n[13] Trappe, W., & Lawrence, C. (2007). \u201cIntroduction to cryptography with\r\ncoding theory\u201d (2nd ed., pp. 66\u201370).Washington: Pearson Education.\r\n[14] Lihao, Xu, & Huang, Cheng. (2008). \u201cComputation-efficient multicast\r\nkey distribution\u201d. IEEE Transactions on Parallel and Distributed\r\nSystems, 19(5), 1\u201310.\r\n[15] Naranjo, J. A. M., Lopez-Ramos, J. A., & Casado, L. G. (2010).\r\n\u201cApplications of the extended Euclidean algorithm to privacy and secure\r\ncommunications\u201d. In Proceedings of the 10th international conference\r\non computational and mathematical methods in science and engineering,\r\nCMMSE, 703\u2013713.\r\n[16] Trappe, W., Song, J., Radha Poovendran, K. J., & Liu, R. (2001) \u201cKey\r\ndistribution for secure multimedia multicasts via data Embedding\u201d.\r\nIEEE International Conference on Acoustics, Speech, and Signal\r\nProcessing, 3, 1449\u20131452.\r\n[17] Lee, J. S., Son, J. H., Park, Y. H., & Seo, S. W. (2008). \u201cOptimal levelhomogeneous\r\ntree structure for logical key hierarchy\u201d. In: Proceedings\r\nof IEEE conference on communication system software and middleware\r\nworkshop, COMSWARE.\r\n[18] Je, D.-H., Lee, J.-S., Park, Y., & Seo, S.-W. (2010). \u201cComputation andstorage-\r\nefficient key tree management protocol for secure multicast\r\ncommunications\u201d. Computer Communications, 33(6), 136\u2013148.\r\n[19] McGrew, A. D., & Sherman, A. T. (2003). \u201cKey establishment in large\r\ndynamic groups using one-way function trees\u201d. IEEE Transactions on\r\nSoftware Engineering, 29(5), 444\u2013458.\r\n[20] Trappe, W., Song, J., Poovendran, R., & Liu, K. J. R. (2003). \u201cKey\r\nmanagement and distribution for secure multimedia multicast\u201d. IEEE\r\nTransactions on Multimedia, 5(4), 544\u2013557.\r\n[21] R. Varalakshmi, Dr.V.Rhymend Uthariaraj,\"Huddle hierarchy based\r\ngroup key management protocol using gray code\", Wireless Networks\r\n(2014) 20:695\u2013704.\r\n[22] Ng, W. H. D., Howarth, M., Sun, Z., & Cruickshank, H. (2007).\r\n\u201cDynamic balanced key tree management for secure multicast\r\nCommunications\u201d. IEEE Transactions on Computers, 56(5), 590\u2013605.\r\n[23] Denis, T. S. (2003). \u201cBigNum math implementing cryptographic\r\nmultiple precision arithmetic\u201d. Rockland, MA: SYNGRESS Publishing.\r\nPp. 91-128","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 105, 2015"}