Secure key agreement for group communications

Yang, Wen-Her; Shieh, Shiuh-Pyng

doi:10.1002/nem.412

Cited by 11 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With a hierarchy of keys, there are different ways to construct rekey messages and securely distribute these to the users 7 . Three rekeying strategies: User-oriented, key-oriented, and group-oriented were investigated.…”

Section: Methodsmentioning

confidence: 99%

Implementing Secure Group Communications using Key Graphs

Cherukuri¹,

Lakshmi²,

Preethi³

2007

DSJ

View full text Add to dashboard Cite

While the technical issues of securing unicast communications for client-server computing are fairly well-understood, the technical issues of securing group communications are not. The existing approach to improve the scalability is to decompose a large group of clients into many subgroups and employ a hierarchy of group security agents. In this paper, the secure group communications using key graphs and the implementation of a different hierarchical approach to improve the scalability and secure group communication using key graphs has been presented.

show abstract

Section: Methodsmentioning

confidence: 99%

Implementing Secure Group Communications using Key Graphs

Cherukuri¹,

Lakshmi²,

Preethi³

2007

DSJ

View full text Add to dashboard Cite

show abstract

“…Node secrets need to be securely distributed to all the users of a class in an efficient and scalable way. Few existing CHAC schemes have dealt with this issue; instead they assume that there is a key distribution scheme which can distribute node secrets to its users securely [12][13][14]. A comprehensive survey of group key management schemes for secure group communication can be found in Zou et al [15].…”

Section: Introductionmentioning

confidence: 99%

A dynamic key management solution to access hierarchy

2007

View full text Add to dashboard Cite

SUMMARYHierarchical access control (HAC) has been a fundamental problem in computer and network systems. Since Akl and Taylor proposed the first HAC scheme based on number theory in 1983, cryptographic key management techniques for HAC have appeared as a new and promising class of solutions to the HAC problem. Many cryptographic HAC schemes have been proposed in the past two decades. One common feature associated with these schemes is that they basically limited dynamic operations at the node level. In this paper, by introducing the innovative concept of 'access polynomial' and representing a key value as the sum of two polynomials in a finite field, we propose a new key management scheme for dynamic access hierarchy. The newly proposed scheme supports full dynamics at both the node level and user level in a uniform yet efficient manner. Furthermore, the new scheme allows access hierarchy to be a random structure and can be flexibly adapted to many other access models such as 'transfer down' and 'depth-limited transfer'.

show abstract

“…The centralized schemes cannot achieve "1 affects n" scalability because they do not rely on any intermediate nodes such as routers to perform access control and key distribution. Distributed schemes [4,5,6] delegate key generation overhead evenly among all members of the group. These schemes would be vulnerable to security attacks from inside the group because of trusting all group members.…”

Section: Introductionmentioning

confidence: 99%

ESKD: An Efficient and Scalable Key Distribution Scheme for Secure Group Communication

Aye

Siddiqi

International Conference on Networking, International Conference on Systems and International Conference on Mobile Communicatio

View full text Add to dashboard Cite

Multicast-based applications demand scalable security solutions for group communication infrastructure.Secure key distribution is one such solution that must be addressed in secure multicast sessions. In this paper, we present our approach named ESKD, is a novel solution to the hierarchical key distribution problem of large one-to-many group communication. ESKD is efficiently designed to achieve scalable and secure dynamic group membership. In ESKD, the intermediate nodes are not trusted and used as relaying nodes to assist in enforcing the secure multicast group without having any access to the multicast data. It combines the public and secret key systems in order to achieve both the speed advantages of secret key cryptosystems and security advantages of public key cryptosystems. ESKD guarantees group key security and group data secrecy. We also provide a comparative analysis of our approach with DEP [1] and show the efficiency of ESKD over DEP.

show abstract

Secure key agreement for group communications

Cited by 11 publications

References 17 publications

Implementing Secure Group Communications using Key Graphs

Implementing Secure Group Communications using Key Graphs

A dynamic key management solution to access hierarchy

ESKD: An Efficient and Scalable Key Distribution Scheme for Secure Group Communication

Contact Info

Product

Resources

About