Round-Efficient Conference Key Agreement Protocols with Provable Security

Tzeng, Wen-Guey; Tzeng, Zhi-Jia

doi:10.1007/3-540-44448-3_47

Cited by 49 publications

(35 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A multi-round GKA protocol poses a synchronism requirement on group members and it needs all group members to simultaneously stay online to complete the protocol. Several proposals (e.g., [8,18,30]) have been motivated to optimize round complexity in GKA protocols. Burmester and Desmedt [12] proposed a two-round n-party GKA protocol for n parties.…”

Section: Related Workmentioning

confidence: 99%

Bridging Broadcast Encryption and Group Key Agreement

Qin

Zhang

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but requires a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (CBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a CBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear DiffieHellman Exponentiation (BDHE) assumption in the standard model. We also illustrate a variant in which the communication and computation complexity is sub-linear with the group size. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Bridging Broadcast Encryption and Group Key Agreement

Qin

Zhang

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Authenticated static group key exchange protocols with constant round have been proposed by Tzeng and Tzeng [24] and Boyd and Nieto [9]. In the protocol [24] with a fixed constant-round, however, the cost of communication is very high.…”

Section: Overviewmentioning

confidence: 99%

“…In the protocol [24] with a fixed constant-round, however, the cost of communication is very high. Each member should compute n modular exponentiations for a group key exchange and additionally perform 3n modular exponentiations for authentications, since non-interactive proof systems are used in the authentication process.…”

Section: Overviewmentioning

confidence: 99%

“…While the responders only perform one signature verification, one decryption in a public cryptosystem and one operation of one-way hash function, the initiator has a heavy burden caused by (n − 1) encryptions in a public cryptosystem and one signature generation. Furthermore, both of these protocols [9,24] cannot provide forward secrecy.…”

Section: Overviewmentioning

confidence: 99%

“…Burmester and Desmedt's protocol provides 2-round and more efficient computation rate of group members than previous protocols [9,24]; each member performs 3 modular exponentiations and ( n 2 2 + 3n 2 − 3) modular multiplications. However, Burmester and Desmedt's protocol has not proposed any authentication method and any clear security proof.…”

Section: Overviewmentioning

confidence: 99%

See 2 more Smart Citations

Constant-Round Authenticated Group Key Exchange for Dynamic Groups

Kim

Lee

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptographic goals. In the paper, we study AGKE schemes for dynamically changing groups in ad hoc networks, i.e., for environments such that a member of a group may join and/or leave at any given time and a group key is exchanged without the help of any central sever. Difficulties in group key managements under such environments are caused by dynamically changing group and existence of no trustee. In most AGKE schemes proposed so far in the literature, the number of rounds is linear with respect to the number of group members. Such schemes are neither scalable nor practical since the number of group members may be quite large and the efficiency of the schemes is severely degraded with only one member's delay. We propose an efficient provably secure AGKE scheme with constant-round. The propose scheme is still contributory and efficient, where each user executes three modular exponentiations and at most O(n) XOR operations.Keyword. dynamic authenticated group key exchange, ad hoc networks.

show abstract

An improved conference‐key agreement protocol for dynamic groups with efficient fault correction

Ermis

Bahtityar²,

Anarım

et al. 2014

Security Comm Networks

View full text Add to dashboard Cite

The pervasive usage of the Internet has made secure group communications a significant issue. Conference-key agreement protocols provide secure group communications with lower computational cost. Providing key agreements and updates of dynamic groups in an efficient manner is a significant challenge for conference-key agreement protocols. Auxiliary key agreement operations are needed to solve the challenge. In this paper, we propose an improved conference-key agreement protocol, called Dynamic Conference-Key Agreement Protocol, that consists of Initial Conference-Key Agreement Protocol and Auxiliary Conference-Key Agreement operations. Dynamic Conference-Key Agreement Protocol has operations to handle dynamic groups. The proposed protocol has better fault correction and provides the same security level with the existing ones.

show abstract

Round-Efficient Conference Key Agreement Protocols with Provable Security

Cited by 49 publications

References 25 publications

Bridging Broadcast Encryption and Group Key Agreement

Bridging Broadcast Encryption and Group Key Agreement

Constant-Round Authenticated Group Key Exchange for Dynamic Groups

An improved conference‐key agreement protocol for dynamic groups with efficient fault correction

Contact Info

Product

Resources

About