Constant-Round Password-Based Group Key Generation for Multi-layer Ad-Hoc Networks

Byun, Jin Wook; Lee, Su-Mi; Lee, Dong Hoon; Hong, Dowon

doi:10.1007/11734666_2

Cited by 15 publications

(28 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, our results are the first known analysis of the protocols in [15], [18].…”

Section: Introductionmentioning

confidence: 82%

“…The n-party EKE-D protocol due to Byun et al in [15] involves n group members and 1 server, and is specially designed to suit particularly multicast networks. Recall that multicast networks allow for communication between a single sender and multiple receivers.…”

Section: N-party Eke Protocolsmentioning

confidence: 99%

“…We consider the security of N-EKE-D and N-EKE-M protocol variants of [13], [14], [18], [15]. Although current protocols require a trusted server S, the advantage of this setting is that it partitions the trust of the group secret among the group members, thus in the event of compromise e.g.…”

Section: Introductionmentioning

confidence: 99%

“…However, attacks were found on this protocol [25], and as a consequence, this protocol was revised in [13], [14], but further attacks were shown in [20], [18]. A variant was given by Nam to resist his attack in [18], while another variant was given at SPC 2006 [15] to cater to mobile ad-hoc networks. All these protocols are also constant-round in the sense that the number of communication rounds is constant irrespective of group size; they make use of broadcast channels.…”

Section: Introductionmentioning

confidence: 99%

“…N-EKE-D [15] comes with an explicit proof of security against undetectable online dictionary attacks by a malicious insider. We contradict this proof by giving such an attack.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Security of Group Key Exchange Protocols with Different Passwords

Phan

2009

2009 International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

“…To the best of our knowledge, our results are the first known analysis of the protocols in [15], [18].…”

Section: Introductionmentioning

confidence: 82%

Section: N-party Eke Protocolsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…N-EKE-D [15] comes with an explicit proof of security against undetectable online dictionary attacks by a malicious insider. We contradict this proof by giving such an attack.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Security of Group Key Exchange Protocols with Different Passwords

Phan

2009

2009 International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

A secure and efficient password‐authenticated group key exchange protocol for mobile ad hoc networks

Chen

Chan

et al. 2011

Int J Communication

View full text Add to dashboard Cite

Password-authenticated group key exchange protocols enable communication parties to establish a common secret key (a session key) by only using short secret passwords. Such protocols have been receiving significant attention. This paper shows some security weaknesses in some recently proposed passwordauthenticated group key exchange protocols. Furthermore, a secure and efficient password-authenticated group key exchange protocol in mobile ad hoc networks is proposed. It only requires constant round to generate a group session key under the dynamic scenario. In other words, the overhead of key generation is independent of the size of a total group. Further, the security properties of our protocol are formally validated by a model checking tool called AVISPA. Security and performance analyses show that, compared with other related group key exchange schemes, the proposed protocol is also efficient for real-world applications in enhancing the security over wireless communications.KEY WORDS: group key exchange; security; mobile ad hoc network; forgery attack Recently, the constant-round password-based group key exchange (in short, NEKED) protocol for password-authenticated key exchange in a multilayer MANET was proposed in [3]. The outstanding feature of this protocol is that it is the first constant round and provably secure scheme in the dynamic scenario. More specifically, the overhead of key generation is independent of the size

show abstract

nPAKE + : A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords

Wan

Deng

Bao

et al. 2007

Information and Communications Security

View full text Add to dashboard Cite

Although two-party password-authenticated key exchange (PAKE) protocols have been intensively studied in recent years, group PAKE protocols have received little attention. In this paper, we propose a hierarchical group PAKE protocol nPAKE + protocol under the setting where each party shares an independent password with a trusted server. The nPAKE + protocol is a novel combination of the hierarchical key tree structure and the password-based Diffie-Hellman exchange, and hence it achieves substantial gain in computation efficiency. In particular, the computation cost for each client in our protocol is only O(log n). Additionally, the hierarchical feature of nPAKE + enables every subgroup obtains their own subgroup key in the end. We also prove the security of our protocol under the random oracle model and the ideal cipher model.

show abstract

Constant-Round Password-Based Group Key Generation for Multi-layer Ad-Hoc Networks

Cited by 15 publications

References 21 publications

Security of Group Key Exchange Protocols with Different Passwords

Security of Group Key Exchange Protocols with Different Passwords

A secure and efficient password‐authenticated group key exchange protocol for mobile ad hoc networks

nPAKE + : A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords

Contact Info

Product

Resources

About