New Method to Compute Auxiliary keys in LKH based Secure Group Key Management Scheme

@article{Aparna2008NewMT,
  title={New Method to Compute Auxiliary keys in LKH based Secure Group Key Management Scheme},
  author={R. Aparna and B. B. Amberker},
  journal={2008 16th International Conference on Advanced Computing and Communications},
  year={2008},
  pages={46-51}
}
  • R. Aparna, B. B. Amberker
  • Published 1 December 2008
  • Computer Science
  • 2008 16th International Conference on Advanced Computing and Communications
With the growth of internet, many network applications are relied on group communication model. To provide confidentiality for the communication between group members, a secret key called group key is used. Since the group is dynamic, whenever there is a membership change (join/leave), group key is changed (rekeying) to provide forward and backward confidentiality. The hierarchical key-tree approach is widely used to achieve logarithmic costs for changing the key. Along with group key, key-tree… 
An Optimization of Rekeying Scheme for Secure Multicast
TLDR
The results show that this scheme can reduce communication cost and storage cost for key server compared to both LKH and the original scheme.
Research on Update strategy in batch group re-keying
TLDR
The structure of the six-probability-optimization key-tree improves scalability of group members and adapts better to the dynamic changes in multicast group membership, and this approach further reduces the overhead of group re-keying and communication costs through performance analysis and simulation experiments.
A novel LKH key tree structure based on heuristic search algorithm
TLDR
The experimental results showed the scheme proposed could efficiently reduce the encryption overhead, transmission overhead and the storage of keys during the rekey process.

References

SHOWING 1-10 OF 13 REFERENCES
Efficient Group Key Management Protocol with One-Way Key Derivation
TLDR
An efficient group key management protocol is proposed for centralized dynamic groups, and one-way key derivation is integrated with key trees to reduce the communication overhead of rekeying operations.
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
TLDR
Among the hierarchical methods, OFT is the first to achieve an approximate halving in broadcast length, an idea on which subsequent algorithms have built.
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.
EHBT: An Efficient Protocol for Group Key Management
TLDR
A new efficient hierarchical binary tree (EHBT) protocol, using EHBT, a group manager can use keys already in the tree to derive newk eys and saves information to be transmitted to members when a membership change occurs and newK eys have to be created or updated.
Distributed collaborative key agreement and authentication protocols for dynamic peer Groups
TLDR
This work provides a fundamental understanding about establishing a group key via a distributed and collaborative approach for a dynamic peer group via three interval-based distributed rekeying algorithms for updating the group key.
ELK, a new protocol for efficient large-group key distribution
TLDR
ELK, a novel key distribution protocol, is designed and implemented to address security challenges of secure media broadcast over the Internet with perfectly reliable, super-efficient member joins and smaller key update messages than previous protocols.
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.
Batch rekeying for secure group communications
TLDR
This paper proposes the use of periodic batch rekeying which can improve efficiency and alleviate the out-of-sync problem between keys and data, and designs a marking algorithm to process a batch of join and leave requests.
Efficient security for large and dynamic multicast groups
  • G. Caronni, Marcel Waldvogel, Dan Sun, B. Plattner
  • Computer Science
    Proceedings Seventh IEEE International Workshop on Enabling Technologies: Infrastucture for Collaborative Enterprises (WET ICE '98) (Cat. No.98TB100253)
  • 1998
TLDR
A series of novel approaches for achieving scalable security in IP multicast, providing privacy and authentication on a group-wide basis are proposed, and have low complexity (O(log N) or less) which grants scalability even for large groups.
Keystone: a Group Key Management Service
A major problem area in securing group communications is group key management. In this paper, we present the design and architecture of a scalable group key management system called Keystone.
...
1
2
...