Analysis of Key Management Schemes for Secure Group Communication and Their Classification

@article{Aparna2009AnalysisOK,
  title={Analysis of Key Management Schemes for Secure Group Communication and Their Classification},
  author={R. Aparna and B. B. Amberker},
  journal={J. Comput. Inf. Technol.},
  year={2009},
  volume={17},
  pages={203-214}
}
Secure Group Communication is very critical for applications like board-meetings, group discussions and teleconferencing. Managing a set of secure group keys and group dynamics are the fundamental building blocks for secure group communication systems. Several group key management techniques have been proposed so far by many researchers. Some schemes are information theoretic and some are complexity theoretic in nature. Users in the secure group may negotiate with each other to derive a common… 

Figures and Tables from this paper

Hierarchical Access control in Dynamic Peer Groups using Symmetric Polynomial and Tree based Group Elliptic Curve Diffie Hellman Scheme
TLDR
This study explores on novel group key agreement approach, which combines both the symmetric polynomial scheme and Tree Based Group elliptic Curve key exchange, which yields a secure protocol suite that is good in fault-tolerant and simple.
Group Key Management in constrained IoT Settings
TLDR
This paper surveys existing GKM mechanisms, analyzes their suitability for constrained IoT settings, and identifies open issues that require further research.

References

SHOWING 1-10 OF 24 REFERENCES
Efficient Collaborative Key Management Protocols for Secure Autonomous Group Communication
TLDR
A new family of protocols addressing collaborative group key agreement for secure group communication in autonomous groups with varying degrees of security and efciency is introduced, which improve previously proposed schemes in the following ways.
Secure group communications using key graphs
TLDR
It is shown that the group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves, and the average measured processing time per join/leave increases linearly with the logarithm of group size.
Secure group communication using robust contributory key agreement
TLDR
This work presents the first robust contributory key agreement protocol resilient to any sequence of group changes, and proves that it provides both virtual synchrony and the security properties of Group Diffie-Hellman, in the presence of any sequences of node failures, recoveries, network partitions, and heals.
Perfectly Secure Key Distribution for Dynamic Conferences
TLDR
This paper considers the model where interaction is allowed in the common key computation phase and shows a gap between the models by exhibiting a one-round interactive scheme in which the user's information is only k + t −1 times the size of the commonKey.
Simple and fault-tolerant key agreement for dynamic collaborative groups
TLDR
This work investigates a novel approach to group key agreement by blending binary key trees with DiAEe-Hellman key exchange, resulting in a protocol suite that is very simple, secure and fault-tolerant.
Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization
TLDR
A scalable method for establishing group session keys for secure large, dynamic groups such as multicast sessions is presented and implemented based on a novel application of One-Way Function Trees (OFTs).
The VersaKey framework: versatile group key management
TLDR
This paper proposes a framework of new approaches for achieving scalable security in IP multicasting, and presents a novel concurrency-enabling scheme, which was devised for fully distributed key management.
A Secure and Efficient Conference Key Distribution System (Extended Abstract)
TLDR
The technique for authentication can be extended and used as the basis for an authentication scheme which is ‘proven’ secure against any type of attack, provided the Discrete Logarithm problem is intractable.
Key Management for Multicast: Issues and Architectures
TLDR
This report identifies a technique which allows for secure compromise recovery, while also being robust against collusion of excluded users, and minimizes the number of transmissions required to rekey the multicast group and it imposes minimal storage requirements on the multicasts group.
Distributed collaborative key agreement protocols for dynamic peer groups
  • P. Lee, John C.S. Lui, D. Yau
  • Computer Science
    10th IEEE International Conference on Network Protocols, 2002. Proceedings.
  • 2002
TLDR
This work considers an interval-based approach of rekeying about establishing a collaborative group key for a distributed dynamic peer group and shows that these three distributed algorithms significantly outperform the individual rekey algorithm, and that the queue-batch algorithm performs the best among the three distributed algorithm.
...
1
2
3
...