A Computationally Efficient Key-Hiding Based Group Re-Keying Scheme For Secure Multicasting
Y.M. Asem, Atsushi Kara · International Journal of Computers and Applications · 2006
Multicast security is becoming an important networking issue because of the growing number of network applications that rely on multicast communication. Scalable group re-keying is one of the biggest challenges that needs to be addressed in order to support secure multicasting. In this paper, we present and analyze a new group re-keying algorithm for establishing cryptographic keys in multicast groups. Our re-keying algorithm is based on hiding the cryptographic group key in a numerical matrix. Our algorithm does not need computationally expensive encryption/decryption for group re-keying. Re-keying message construction and group key retrieval processes need only simple logical operations. For a given re-keying matrix, the computational cost for group re-keying is constant regardless of the number of group members.