Keeping group communications private: An up-to-date review on centralized secure multicast
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Journal of Computational and Applied Mathematics
Hierarchical approaches for multicast based on Euclid's algorithm
The Journal of Supercomputing
| Hi-index | 0.00 |
In a secure multicast environment, the distribution of cryptographic keys may be a primary indicator of system performance. The mathematics of public key cryptography do not scale well especially for large multi-user networks, and a symmetric-key-based system is not feasible over a network spread out geographically. The problems become even more complicated when we begin dealing with multiple levels of security, i.e. different classification levels of traffic as well as group memberships/permissions. In this paper, we present a new approach to multi-level secure multicast, one that uses the secure lock encryption scheme based on themathematics of the Chinese Remainder Theorem to distribute keys to various subgroups. Our solution can be applied to both one-to-many and many-to-many group communications. In addition, it presents a viable solution for the distribution of one-time session keys during actual message transmission.