Authenticated Group Key Transfer Protocol Based on Secret Sharing

Harn, Lein; Lin, Changlu

doi:10.1109/tc.2010.40

Cited by 148 publications

(102 citation statements)

References 28 publications

(29 reference statements)

Supporting

Mentioning

102

Contrasting

Order By: Relevance

“…In centralized group key management protocols, a group KGC is engaged in managing the entire group. The class of centralized group key management protocols is the most widely used group key management protocols, such as those in [1][2][3][4]14,15]. In distributed group key management protocols, there is no explicit group key distribution center, and each group member can contribute to the key generation and distribution.…”

Section: Introductionmentioning

confidence: 99%

“…There are two types of group key distribution protocols: one assumes a trusted offline server, which is active only at initialization [11,12], and the other assumes a trusted server, which is always active [12][13][14][15][16]. The first type of approach is also called the key predistribution scheme.…”

Section: Introductionmentioning

confidence: 99%

“…In 1989, Laih et al [16] proposed the first algorithm on the basis of this approach using any (t, n) secret sharing scheme to distribute a group key to a group consisting of (t À 1) members. Later, there are some other protocols [12][13][14][15] following the same concept.…”

Section: Introductionmentioning

confidence: 99%

“…In 2010, Harn et al [14] proposed an authenticated group key transfer protocol-based secret sharing, which belongs to the second type. In their protocol, each user needs to register at the KGC to subscribe the group key transfer service and to establish a secret with the KGC.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Improved group key transfer protocols from the protocol of Harn et al.

Wang

2012

Security Comm Networks

View full text Add to dashboard Cite

In 2010, Harn et al. proposed an authenticated group key transfer protocol-based secret sharing. In their protocol, for distributing a secret group key involving t group members, the key generation center (KGC) needs to broadcast a message containing (t + 1) elements to all group members, whereas each group member needs to compute a tth-degree interpolating polynomial to recover the secret group key. Thus, the protocol of Harn et al. is only suitable for small-size groups. We propose an improved protocol from the protocol of Harn et al. In our protocol, the size of a broadcasted message from the KGC is fixed, and each group member only needs to compute a fixed-degree interpolating polynomial to recover the group key. Thus, our protocol can be suitable for large-size groups. On the other hand, in the protocol of Harn et al., the KGC should be mutually trusted because it knows all group keys for every communication. If the KGC is untrustworthy, it can bring great threats to the group communications. In this paper, we also propose another improved group key transfer protocol based on untrustworthy KGC.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved group key transfer protocols from the protocol of Harn et al.

Wang

2012

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…This scheme also doesn't provide secure communication between the sink node and cluster heads. Based on Shamir's (t, n) secret sharing (SS), Harn and Lin (2010) [35] proposed an authenticated group key distribution protocol. This scheme need a key generation center to construct and transfer the group key which increases the overhead required for the system implementation.…”

Section: Related Workmentioning

confidence: 99%

Efficient Group Key Management using Symmetric Key and Threshold Cryptography for Cluster based Wireless Sensor Networks

Diop¹,

Qi²,

Wang³

2014

IJCNIS

View full text Add to dashboard Cite

Abstract-Research in Wireless Sensor Networks (WSNs) has made a significant progress recently, especially the area of key management, which plays a central role for protecting group communication in sensor networks. In sensor networks, the data are crucial and have to keep secrecy in data communication. To achieve data confidentiality, adversary should not have access to the group communication. Therefore due to the limited memory resources and energy constraints of sensor nodes, reducing the communication and storage overhead, and improving the resilience against the node capture attack become a must.In this paper we propose An Efficient Group Key Management using Symmetric Key and Threshold Cryptography for Cluster based Wireless Sensor Networks (EGKMST). The proposed scheme considers a hierarchical cluster structure of sensor network and adopts the pair-wise key management and group key management based on threshold key cryptography to generate and to distribute the keys efficiently within a cluster and updates periodically keys. By this way EGKMST provides continuous transmission security and avoids dangerous attacks from malicious nodes and mitigate the node compromise attack in WSNs communication. The security and performance analysis illustrate that EGKMST scheme achieves the requirement of group communication and provides efficient security with low communication cost, low memory overhead and energy saving compared with some existing key management schemes.

show abstract

Secure lightweight multi‐party key agreement based on hyperelliptic curve Diffie–Hellman for constraint networks

Naresh¹,

Reddi²

2022

Concurrency and Computation

View full text Add to dashboard Cite

With recent developments in hyperelliptic curve cryptographic system (HECC) processing and the proposed work, the myth that HECC is not suited for practical applications in constrained networks is dispelled. This article proposes dynamic authenticated contributory group key agreement (DACGKA) protocol using HEC-DH. The DACGKA is less costly and ideally appropriate for resource-restricted networks such as VANETs, MANETs, and WSNs because of its lesser key sizes and advancements in operational processing. The suggested protocol is implemented across a finite field using an HEC of genus 1 (ECC), genus 2, and genus 3, with promising results, including a significant reduction in key size and exchange overhead, an increase in key safety, and a broader range of applicability. According to a comparison of the proposed approach on different genus curves, HECC over genus 2 with a suitable key length can be applied for memory and power restricted devices to increase data secrecy and system efficiency. Further, HECC can outperform ECC for low-cost, secure group communication applications.As a part of security analysis, first, we proved that each coordinate of HEC-DH secret value is as hard as the entire DH value, and then concrete security proofs based on the HEC-DLP were established. K E Y W O R D Sconstraint networks, group key agreement, hyperelliptic curves, Jacobian, key exchange operations INTRODUCTIONA range of collaborative applications focusing on secure group communication (SGC) is becoming a more active study field in cryptography. It is based on specific distribution and management strategies. All group key agreement (GKA) protocols can be classified into one of two groups. The key is generated by a single group member and distributed to the remaining members in the first. However, it necessitates the involvement of a reliable third party and a safe route between a trustworthy third party and the group members. As a result, key distribution and administration become more complicated. On the other hand, contributory group key agreements (CGKAs) are GKAs in which each member gives a portion of the group key (GK). The focus of this work is on a protocol that falls into the second category.GKA allows SGC across an unprotected, open network by producing the GK. Well-established GKA 1-10 allows participants to agree on a GK in the presence of an alive opponent using signature techniques. To guarantee confidentiality and integrity in the SGC, group members use their authenticated group key with cryptographic techniques.The simplicity and beauty of the 2-party Diffie-Hellman (DH) key agreement 11 has prompted several researchers to apply it to group situations.The majority of GKA protocols are based on DLP. On the other hand, Constraint networks require longer key lengths and higher computational demands. Elliptic curve cryptography (ECC) 12,13 is the natural solution to this problem since, with reduced key sizes, cheaper computational costs, and increased efficiency, it can provide good security.

show abstract

Authenticated Group Key Transfer Protocol Based on Secret Sharing

Cited by 148 publications

References 28 publications

Improved group key transfer protocols from the protocol of Harn et al.

Improved group key transfer protocols from the protocol of Harn et al.

Efficient Group Key Management using Symmetric Key and Threshold Cryptography for Cluster based Wireless Sensor Networks

Secure lightweight multi‐party key agreement based on hyperelliptic curve Diffie–Hellman for constraint networks

Contact Info

Product

Resources

About