Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29296


Select areas to restrict search in scientific publication database:
10003002
Bit Model Based Key Management Scheme for Secure Group Communication
Abstract:
For the last decade, researchers have started to focus their interest on Multicast Group Key Management Framework. The central research challenge is secure and efficient group key distribution. The present paper is based on the Bit model based Secure Multicast Group key distribution scheme using the most popular absolute encoder output type code named Gray Code. The focus is of two folds. The first fold deals with the reduction of computation complexity which is achieved in our scheme by performing fewer multiplication operations during the key updating process. To optimize the number of multiplication operations, an O(1) time algorithm to multiply two N-bit binary numbers which could be used in an N x N bit-model of reconfigurable mesh is used in this proposed work. The second fold aims at reducing the amount of information stored in the Group Center and group members while performing the update operation in the key content. Comparative analysis to illustrate the performance of various key distribution schemes is shown in this paper and it has been observed that this proposed algorithm reduces the computation and storage complexity significantly. Our proposed algorithm is suitable for high performance computing environment.
Digital Object Identifier (DOI):

References:

[1] Wallner, D. M., Harder, E. J., & Agee, R. C. (1997). “Key management for multicast: issues and architectures. Informational RFC, draft- Wallnerkey-arch-ootxt, July 1997.
[2] Chang, I., Engel, R., Kandlur, D., Pendarakis, D., & Daha, D. (1999). “Key management for secure internet multicast using Boolean function minimization technique”. In ACM SIGCOMM’ 99, March 1999.
[3] Varalakshmi, R., & Uthariaraj, V. R. (2011). “A new secure multicast group key management using gray code”,IEEE-Xplore
[4] Li, M., Poovendran, R., & McGrew, D. A. (2004). “Minimizing center key storage in hybrid one-way function based group key management with communication constraints”. Information Processing Letters, 93, 191–198.
[5] Poovendran, R., & Baras, J. S. (2001). “An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes”. IEEE Transactions on Information Theory, 47, 2824–2834.
[6] Kulkarni, S. S., & Bruhadeshwar, B. (2010). “Key-update distribution in secure group communication”. Computer Communications, 33(6), 689– 705.
[7] Bruhadeshwar, B., Kothapalli, K., & Deepya, M. S. (2009). “Reducing the cost of session key establishment.” In ARES (2009),pp. 369–373.
[8] Bruhadeshwar, B., Kothapalli, K., Poornima, M., & Divya, M. (2009). “Routing protocol security using symmetric key based Techniques”. In ARES (2009), pp. 193–200.
[9] Wang, S.-J., Tsai, Y.-R., Shen, C.-C., & Chen, P.-Y. (2010). “Hierarchical key derivation scheme for group-oriented communication systems”. International Journal of Information Technology, Communications and Convergence, 1(1), 66–76.
[10] Imani, M., Taheri, M., & Naderi, M. (2010). “Security enhanced routing protocol for ad hoc networks”. Journal of Convergence, 1(1), 43–48.
[11] Wong, C., Gouda, M., & Lam, S. (2002). “Secure group communications using key graphs”. IEEE/ACM Transactions on Networking, 8, 16–30.
[12] Blaum, M., Bruck, J., & Vardy, A. (1996). “MDS array codes with independent parity symbols”. IEEE Transactions on Information Theory, 42(2), 529–542.
[13] Trappe, W., & Lawrence, C. (2007). “Introduction to cryptography with coding theory” (2nd ed., pp. 66–70).Washington: Pearson Education.
[14] Lihao, Xu, & Huang, Cheng. (2008). “Computation-efficient multicast key distribution”. IEEE Transactions on Parallel and Distributed Systems, 19(5), 1–10.
[15] Naranjo, J. A. M., Lopez-Ramos, J. A., & Casado, L. G. (2010). “Applications of the extended Euclidean algorithm to privacy and secure communications”. In Proceedings of the 10th international conference on computational and mathematical methods in science and engineering, CMMSE, 703–713.
[16] Trappe, W., Song, J., Radha Poovendran, K. J., & Liu, R. (2001) “Key distribution for secure multimedia multicasts via data Embedding”. IEEE International Conference on Acoustics, Speech, and Signal Processing, 3, 1449–1452.
[17] Lee, J. S., Son, J. H., Park, Y. H., & Seo, S. W. (2008). “Optimal levelhomogeneous tree structure for logical key hierarchy”. In: Proceedings of IEEE conference on communication system software and middleware workshop, COMSWARE.
[18] Je, D.-H., Lee, J.-S., Park, Y., & Seo, S.-W. (2010). “Computation andstorage- efficient key tree management protocol for secure multicast communications”. Computer Communications, 33(6), 136–148.
[19] McGrew, A. D., & Sherman, A. T. (2003). “Key establishment in large dynamic groups using one-way function trees”. IEEE Transactions on Software Engineering, 29(5), 444–458.
[20] Trappe, W., Song, J., Poovendran, R., & Liu, K. J. R. (2003). “Key management and distribution for secure multimedia multicast”. IEEE Transactions on Multimedia, 5(4), 544–557.
[21] R. Varalakshmi, Dr.V.Rhymend Uthariaraj,"Huddle hierarchy based group key management protocol using gray code", Wireless Networks (2014) 20:695–704.
[22] Ng, W. H. D., Howarth, M., Sun, Z., & Cruickshank, H. (2007). “Dynamic balanced key tree management for secure multicast Communications”. IEEE Transactions on Computers, 56(5), 590–605.
[23] Denis, T. S. (2003). “BigNum math implementing cryptographic multiple precision arithmetic”. Rockland, MA: SYNGRESS Publishing. Pp. 91-128
Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007