A Group Key Distribution Scheme with Decentralised User Join

Kurnio, Hartono; Wang, Huaxiong

doi:10.1007/3-540-36413-7_11

Cited by 7 publications

(8 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However these models do not consider the possibility that a coalition of users in the group can invite a new user to the group. This feature has been considered in other protocols to distribute keys as group key distribution schemes [5,4]. In this section we propose a model for this feature.…”

Section: Self-healing Key Distribution Schemes With Sponsorizationmentioning

confidence: 99%

“…To construct this family of self-healing key distribution schemes with sponsorization we follow in part ideas of Scheme 2 in [1] and sponsorization mechanism in [5,4]. Our construction has three main differences with Scheme 2 in [1].…”

Section: A Family Of Self-healing Key Distribution Schemes With Sponsmentioning

confidence: 99%

“…Of course the proposal considers the case in which certain majorities (the coalition of authorized subsets of users to sponsor) can perform this action. This feature has been considered in other distributed protocols as group key distribution schemes [5,4]. In Section 3 some lower bounds on the resources required to such schemes are presented.…”

Section: Introductionmentioning

confidence: 99%

“…In Section 4 a family of self-healing key distribution schemes with sponsorization is presented. This construction follows in part the ideas of [1] but considering any possible linear secret sharing scheme instead of a threshold one and ideas of [5,4] for sponsorization capability. At the end of the section we comment the security and efficiency of the scheme.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Self-healing Key Distribution Schemes with Sponsorization

Sáez

2005

Communications and Multimedia Security

View full text Add to dashboard Cite

Abstract. In a self-healing key distribution scheme a group manager enables a large and dynamic group of users to establish a group key over an unreliable network. The group manager broadcasts in every session some packet of information in order to provide a common key to members of the session group. The goal of self-healing key distribution schemes is that, even if the broadcast is lost in a certain session, the group member can recover the key from the broadcast packets received before and after the session. This approach to key distribution is quite suitable for wireless networks, mobile wireless ad-hoc networks and in several Internet-related settings, where high security requirements need to be satisfied.In this work we provide a generalization of previous definitions in two aspects. The first one is to consider general structures instead of threshold ones to provide more flexible performance to the scheme. The second one is to consider the possibility that a coalition of users sponsor a user outside the group for one session: we give the formal definition of selfhealing key distribution schemes with sponsorization, some bounds on the required amount of information. We also give a general construction of a family of self-healing key distribution schemes with sponsorization by means of a linear secret sharing scheme. Our construction differs from previous self-healing key distribution schemes in the fact that the length of the broadcast is almost constant. Finally we analyze the particular case of this general construction when Shamir's secret sharing scheme is used.

show abstract

Section: Self-healing Key Distribution Schemes With Sponsorizationmentioning

confidence: 99%

Section: A Family Of Self-healing Key Distribution Schemes With Sponsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Self-healing Key Distribution Schemes with Sponsorization

Sáez

2005

Communications and Multimedia Security

View full text Add to dashboard Cite

show abstract

“…Group key distribution schemes [12], [23] are also managed by the users of the group themselves, but are more suitable for dynamic situations, where users can join or leave the group at any period of time, which is decided by the own group members. This dynamism capability makes these schemes slightly different from group key exchange protocols, which must be reinitialized every time that the composition of the group changes.…”

Section: Introductionmentioning

confidence: 99%

On the Computational Security of a Distributed Key Distribution Scheme

Daza

Herranz

Sáez

2008

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme [11] which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in [24] which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss.

show abstract

Secure Construction of Virtual Organizations in Grid Computing Systems

Lam

Chung

et al. 2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Virtual organization (VO) is an important abstraction for designing large-scale distributed applications involving extensive resourcesharing. Existing works on VO mostly assumes that the VO already exists or is created by mechanisms outside of their system model. The VO construction is challenging and critical due to its dynamic and distributed nature. This paper presents a VO Construction Model and an implementation algorithm which is based on a threshold approach and is secure and robust in that events such as member admission, member revocation, VO splitting and merging etc. can be handled without centralized administration. Also authentication and communications among VO members are efficient and without tedious key exchanges and management usually needed in VO built upon the Grid Security Infrastructure (GSI).

show abstract

A Group Key Distribution Scheme with Decentralised User Join

Cited by 7 publications

References 28 publications

Self-healing Key Distribution Schemes with Sponsorization

Self-healing Key Distribution Schemes with Sponsorization

On the Computational Security of a Distributed Key Distribution Scheme

Secure Construction of Virtual Organizations in Grid Computing Systems

Contact Info

Product

Resources

About