Group Re-keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field GF(2n)

Azman Samsudin,Mohammad Ahmad Alia,Sundaram Sudha

doi:10.3844/ajassp.2009.1714.1717

Abstract

Problem statement: In this study we propose a group re-keying protocol based on modular polynomial arithmetic over Galois Field GF(2n). Common secure group communications requires encryption/decryption for group re-keying process, especially when a group member is leaving the group. Approach: This study proposes secret keys multiplication protocol based on modular polynomial arithmetic (SKMP), which eliminates the need for the encryption/decryption during the group re-keying. Results: The implementation based on modular polynomial arithmetic over Galois Field GF(2n) offers fast re-keying process (about 50% faster than Secret Keys Multiplication Protocol (SKM) for 128 bit key) and compact key size representation against other secret keys multiplication protocols. With SKMP group re-keying is handled more efficiently through modular polynomial arithmetic manipulation rather than the expensive encryption/encryption which need to be done on every membership change.

Highlights

In the modern world, most user-based network applications such as multimedia streaming, multi-party video conferencing, pay per view of digital media content and others; need efficient, scalable and secure group communication
Multicast communication is a network protocol that is being used for communication among users to deliver data from a sender to multi-receivers efficiently
Data is delivered only to a group of anathematized users which is denoted as multicast group

Summary

INTRODUCTION

Most user-based network applications such as multimedia streaming, multi-party video conferencing, pay per view of digital media content and others; need efficient, scalable and secure group communication. The SKM protocol uses the logical tree hierarchy of key exchange among the group members by multiplying the group secret keys. SKM protocol uses secret key multiplication in conjunction with the key tree approach. Existing secrets keys multiplication protocol: There are several proposed scalability multicast group reis managed by the trusted server called Group. In a secure group communication protocol, the group controller sends to the group members a new key to process has to be done. Before generates a new secret key, the GC changes its authorize new users as well as performs the group re- private key from kc to kc’. Users u1-u3 and u4-u6 can recover the new session key by using either the respective auxiliary keys, k123 or k456:.

MATERIALS AND METHODS

RESULTS

DISCUSSION

CONCLUSION