Error Detection and Correction for Distributed Group Key Agreement Protocol

Integrating an efficient Error detection and correction scheme with less encoding and decoding complexity to support the distribution of keying material in a secure group communication is an important issue, since the amount of information carried out in the wireless channel is high which produces more errors due to noise available in the communication channel. Moreover, the key must be sent securely to the group members. In this paper, we propose a new efficient group key computation protocol that provides more security and also integrates an encoding method in sender side and decoding method in the receiver side. To achieve security in key computation process, we propose Euler's totient function based Diffie-hellman key distribution protocol. To provide efficient error detection and correction method while distributing the Keying and re-keying information, we introduce tanner graph based encoding stopping set construction algorithm in sender and receiver side of the group communication. Two major operations in this scheme are joining and leaving operations for managing group memberships. The encoding and decoding complexity of this approach is computed in this paper and it is proved that this proposed approach takes less decoding time complexity.

[1]  Ratna Dutta,et al.  Dynamic Group Key Agreement in Tree-Based Setting , 2005, ACISP.

[2]  Cheng Huang,et al.  Computation-Efficient Multicast Key Distribution , 2008, IEEE Transactions on Parallel and Distributed Systems.

[3]  Mingxing He,et al.  A communication-efficient key agreement protocol in ad hoc networks , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[4]  Alan T. Sherman,et al.  Key Establishment in Large Dynamic Groups Using One-Way Function Trees , 2003, IEEE Trans. Software Eng..

[5]  Simon Litsyn,et al.  Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity , 2006, IEEE Transactions on Information Theory.

[6]  K. J. Ray Liu,et al.  Key management and distribution for secure multimedia multicast , 2003, IEEE Trans. Multim..

[7]  Yuguang Fang,et al.  MABS: Multicast Authentication Based on Batch Signature , 2010, IEEE Transactions on Mobile Computing.

[8]  José M. F. Moura,et al.  Linear Time Encoding of LDPC Codes , 2008, IEEE Transactions on Information Theory.

[9]  José M. F. Moura,et al.  TS-LDPC Codes: Turbo-Structured Codes With Large Girth , 2007, IEEE Transactions on Information Theory.

[10]  Alex J. Grant,et al.  Iterative encoding of low-density parity-check codes , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[11]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[12]  S. Siva Subramanian,et al.  An effective key distribution protocol for secure multicast communication , 2010, ICoAC 2010.

[13]  David K. Y. Yau,et al.  Distributed collaborative key agreement protocols for dynamic peer groups , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[14]  Mahalingam Ramkumar The Subset Keys and Identity Tickets (SKIT) Key Distribution Scheme , 2010, IEEE Transactions on Information Forensics and Security.

[15]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[16]  Arputharaj Kannan,et al.  A Secure Key Distribution Protocol for Multicast Communication , 2011 .

[17]  Gene Tsudik,et al.  Tree-based group key agreement , 2004, TSEC.

[18]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[19]  Alexander Vardy,et al.  MDS array codes with independent parity symbols , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[20]  Jose M. F. Moura,et al.  Efficient encoding of cycle codes: a graphical approach , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[21]  T. Apostol Introduction to analytic number theory , 1976 .

[22]  Radha Poovendran,et al.  Minimizing center key storage in hybrid one-way function based group key management with communication constraints , 2005, Inf. Process. Lett..

[23]  Antonio Lioy,et al.  The ForwardDiffSig Scheme for Multicast Authentication , 2010, IEEE/ACM Transactions on Networking.

[24]  T. Mittelholzer Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes , 2002, Proceedings IEEE International Symposium on Information Theory,.

[25]  Hamamache Kheddouci,et al.  A tree-based group key agreement scheme for secure multicast increasing efficiency of rekeying in leave operation , 2009, 2009 IEEE Symposium on Computers and Communications.

[26]  Mohamed G. Gouda,et al.  Secure group communications using key graphs , 1998, SIGCOMM '98.