A tree-based scheme for security of many-to-many communications

Authors:
Ren-Hung Lin;Jinn-Ke Jan
Affiliations:
Institute of Applied Mathematics, National Chung Hsing University, Taichung 402, Taiwan, ROC;Institute of Computer Science, National Chung Hsing University, Taichung 402, Taiwan, ROC Tel.: +886-(0)4-22858200, Fax: +886-(0)4-22853869, E-mail: renhung@amath.nchu.edu.tw jkjan@cs.nchu.edu.tw
Venue:
Journal of High Speed Networks - Broadband Multimedia Sensor Networks in Healthcare Applications
Year:
2007

Citing 10
Cited 2

Secure group communications using key graphs

IEEE/ACM Transactions on Networking (TON)
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM - Special 25th Anniversary Issue
Key Establishment in Large Dynamic Groups Using One-Way Function Trees

IEEE Transactions on Software Engineering
A survey of key management for secure group communication

ACM Computing Surveys (CSUR)
A scalable key-management scheme with minimizing key storage for secure group communications

International Journal of Network Management
Traitor tracing for prerecorded and recordable media

Proceedings of the 4th ACM workshop on Digital rights management
A key-chain-based keying scheme for many-to-many secure group communication

ACM Transactions on Information and System Security (TISSEC)
Tracing traitors

IEEE Transactions on Information Theory
Sequential traitor tracing

IEEE Transactions on Information Theory
A survey of proposals for an alternative group communication service

IEEE Network: The Magazine of Global Internetworking

A Multi-service Group Key Management Scheme for Stateless Receivers in Wireless Mesh Networks

Mobile Networks and Applications
Load Balancing Aware Multiparty Secure Group Communication for Online Services in Wireless Mesh Networks

International Journal of Wireless Networks and Broadband Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many-to-many group secure communications, group members may broadcast or receive messages during any session. A fast session key distribution scheme is desirable for handling highly changeable message flows among group members. In this paper, we propose a group keying scheme using tree structures for many-to-many group secure communications. The key storage and computational complexity of the proposed scheme are acceptable and practical for real-life applications. Moreover, once keys are distributed, group members will be able to freely communicate with any member in security with no need of a group controller.