Hierarchical approaches for multicast based on Euclid's algorithm

Authors:
J. A. Álvarez-Bermejo;N. Antequera;J. A. López-Ramos
Affiliations:
Department of Informatics, University of Almería, Almería, Spain 04120;Department of Mathematics, University of Almería, Almería, Spain 04120;Department of Mathematics, University of Almería, Almería, Spain 04120
Venue:
The Journal of Supercomputing
Year:
2013

Citing 11
Cited 0

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
Efficient and secure keys management for wireless mobile communications

Proceedings of the second ACM international workshop on Principles of mobile computing
Key Establishment in Large Dynamic Groups Using One-Way Function Trees

IEEE Transactions on Software Engineering
Multi-level Secure Multicast: The Rethinking of Secure Locks

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A survey of key management for secure group communication

ACM Computing Surveys (CSUR)
Cryptanalysis of multicast protocols with key refreshment based on the extended euclidean algorithm

CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
A suite of algorithms for key distribution and authentication in centralized secure multicast environments

Journal of Computational and Applied Mathematics
A scalable key distribution scheme for conditional access system in digital pay-TV system

IEEE Transactions on Consumer Electronics
The VersaKey framework: versatile group key management

IEEE Journal on Selected Areas in Communications
Key management approaches to offer data confidentiality for secure multicast

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a hierarchical approach for secure multicast where rekeying of groups of users is made through a method based on Euclid's algorithm for computing GCD. We consider tree arrangements of users that decrease requirements on bandwidth as protocols of the same nature, but also show that computational requirements are less than in other similar approaches. We also introduce a distributed protocol by groups with group managers that not only helps to decrease size of rekeying messages with respect to a centralized approach, but also to increase the security level concerning authentication of users and distributed information.