N-Party Encrypted Diffie-Hellman Key Exchange Using Different Passwords

Byun, Jin Wook; Lee, Dong Hoon

doi:10.1007/11496137_6

Cited by 27 publications

(35 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, N-EKE-D is one of the latest variants that builds on the N-EKE-M protocol originally proposed in [12]. Due to attacks in [25], the designers revised the protocol in [13], [14], which we denote as N-EKE-M + .…”

Section: N-party Eke Protocolsmentioning

confidence: 99%

“…Due to attacks in [25], the designers revised the protocol in [13], [14], which we denote as N-EKE-M + . This is shown in Fig.…”

Section: N-party Eke Protocolsmentioning

confidence: 99%

“…The first provably secure group PAKE protocol for n parties is due to Byun et al [12]. 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].…”

Section: Introductionmentioning

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.…”

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

Section: N-party Eke Protocolsmentioning

confidence: 99%

“…Due to attacks in [25], the designers revised the protocol in [13], [14], which we denote as N-EKE-M + . This is shown in Fig.…”

Section: N-party Eke Protocolsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Authenticated Public Key Distribution Scheme Without Trusted Third Party

Koo

Kim

Lee

2005

Embedded and Ubiquitous Computing – EUC 2005 Workshops

Self Cite

View full text Add to dashboard Cite

Public key authentication is necessary to prevent a valid public key of a user from being compromised by a malicious user. Namely, if it is not provided, an adversary can read all encrypted messages between a sender and a receiver by substituting the public key of the receiver with her public key. In general, a certificate issued from and digitally signed by a publicly trusted certificate authority (CA) guarantees public key authentication under the assumption that all users can get the public key of the CA to verify the validity of certificates, i.e., the signatures of the CA. The assumption is practical and widely used in the real world. However, if the CA is down by a system faults or destroyed by a terror or a war, the assumption can not be preserved. In this paper, we propose a simple and practical scheme for public key authentication without any trusted third party. The scheme basically uses a message authentication code (MAC) taking a short random value as a key to authenticate the exchanged public keys. Our scheme also can be adopted in the environments such as ad-hoc or ubiquitous in which it is hard to settle a publicly trusted authority.

show abstract

N-Party Encrypted Diffie-Hellman Key Exchange Using Different Passwords

Cited by 27 publications

References 30 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

Authenticated Public Key Distribution Scheme Without Trusted Third Party

Contact Info

Product

Resources

About