The week's pick
Random Articles
Reseach Article
A Secure Group Communication and Rekeying using Rabinís Squaring Trapdoor Function in Multicasting
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 20 - Number 1 |
| Year of Publication: 2011 |
| Authors: D. Manivannan, A.R.Shloka, P.Neelamegam |
10.5120/2401-3194
|
D. Manivannan, A.R.Shloka, P.Neelamegam . A Secure Group Communication and Rekeying using Rabinís Squaring Trapdoor Function in Multicasting. International Journal of Computer Applications. 20, 1 ( April 2011), 1-7. DOI=10.5120/2401-3194
Abstract
In today’s world of internet, secure communication among group of members has become vital, where multicasting plays an important role. In secure multicasting, security and scalability are the two important checks. Sometimes there is tradeoff between security and scalability. In order to transmit the data in a secure and scalable way, a suitable key management protocol should be implemented which reduces the number of rekey messages generated during the join or leave of any member thereby preserving forward and backward secrecy. In our proposed work, a new key management protocol has been proposed where a hierarchical structure has been implemented to improve the scalability. Derivation key is used to generate the new keys from the existing keys and Rabin’s Squaring Trapdoor Function is used as the key derivation function to distribute the rekey messages. The security of the key derivation function lies in the hard mathematical problem of integer factorization which cannot be solved in a polynomial time. In order to increase the security, a salt value has been used along with the derivation keys for key stretching so that original keys used in the derivation function cannot be found out. The proposed protocol reduces the rekey messages by 1/d, in a d-degree tree and the number of modular exponential operations is only 2h compared to 3h in TGDH (Tree-based Group Diffie-Hellman) protocol, where h is the height of the tree.
References
- S. Mittra, 1997. Iolus: “A framework for scalable secure multicasting," ACM SIGCOMM Computer Communication Review, vol. 27, no. 4, pp. 277-288.
- S. Rafaeli and D. Hutchinson, 2003. A survey of key management for secure group communication, ACM Computing Surveys, vol. 35, no.3, pp. 309-329.
- D. Balenson, D. McGrew, A. Sherman, Internet-draft, August 2000. Key management for large dynamic groups: one-way function trees and amortized initialization”, Internet Draft, IRTF.
- W.-C. Ku, S.-M. Chen, 2003. An improved key management scheme for large dynamic groups using one-way function trees, Proceedings of the IEEE International Conference on parallel Processing Workshops.
- H. Harney, E. Harder, August 1999. Logical key hierarchy protocol, Internet Draft, IETF.
- Wong, M. Gouda, S. Lam, 1998. Secure group communications using key graphs, Proceedings of the ACM SIGCOMM'98, ACM, pp. 68–79.
- Kin-Chin Chan, S.H.Gary Chan. Key management approaches to offer data confidentiality for secure multicast, Hong Kong University of science and technology.
- Mike Burmester, Yvo Desmedt. A Secure and Efficient Conference Key Distribution System.
- Matthew Moyer, Georgia Institute of Technology, Josyula R.Rao, Pankaj Rohatgi, IBM Thomas J.Watson Research center. A Survey of Security Issues in Multicast Communications.
- Yong dae Kim, Adrian Perrig, and Gene Tsudik. Tree-based Group Key Agreement.
- Laurent Eschenauer, Virgil D. Gligor. A Key Management Scheme for Distributed Sensor Networks.
- Jen-Chiun Lin, Kuo-Hsuan Huang, Feipei Lai, Hung-Chang Lee. Secure and efficient group key management with shared key derivation.
- July 1997. Group Key Management Protocol (GKMP) Architecture”, RFC 2094.
Index Terms
Keywords