A computationally efficient key-hiding based group re-keying scheme for secure multicasting

Authors:
Y. M. Asem;A. Kara
Affiliations:
Department of Computer Systems, University of Aizu, Aizu Wakamatsu, Fukushima, Japan;Department of Computer Systems, University of Aizu, Aizu Wakamatsu, Fukushima, Japan
Venue:
International Journal of Computers and Applications
Year:
2006

Citing 6
Cited 1

Secure Broadcasting Using the Secure Lock

IEEE Transactions on Software Engineering
Iolus: a framework for scalable secure multicasting

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Secure group communications using key graphs

IEEE/ACM Transactions on Networking (TON)
Key management for restricted multicast using broadcast encryption

IEEE/ACM Transactions on Networking (TON)
Key Agreement in Dynamic Peer Groups

IEEE Transactions on Parallel and Distributed Systems
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy

An efficient re-keying scheme for cluster based wireless sensor networks

ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.