2008
DOI: 10.1016/j.jss.2007.11.720
|View full text |Cite
|
Sign up to set email alerts
|

A round- and computation-efficient three-party authenticated key exchange protocol

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
50
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 49 publications
(50 citation statements)
references
References 15 publications
0
50
0
Order By: Relevance
“…Chen et al [31] pointed out that to enhance the performance and reduce latency of an AKA protocol, the communication steps in the protocol should be as parallel as possible. To enhance the proposed protocol performance, a parallel version of the protocol is presented.…”
Section: Mutual Authentication and Key Agreement Phasementioning
confidence: 99%
See 1 more Smart Citation
“…Chen et al [31] pointed out that to enhance the performance and reduce latency of an AKA protocol, the communication steps in the protocol should be as parallel as possible. To enhance the proposed protocol performance, a parallel version of the protocol is presented.…”
Section: Mutual Authentication and Key Agreement Phasementioning
confidence: 99%
“…Note that compared with TG add and T H , TG e , TG mul , T exp and TG H are more time-consuming [31]. The proposed protocol adopts an imbalanced computation technique and an online/offline computation technique to reduce the computational load for the client side.…”
Section: Performance Analysismentioning
confidence: 99%
“…The first efficient three-party authenticated key exchange protocol based on PKC was proposed by Chen et al [5]. The scheme proposes low round complexity to achieve mutual authentication.…”
Section: *Author For Correspondencementioning
confidence: 99%
“…In this subsection, we introduce Chen et al's authentication scheme [19] using Schnorr's self-verified signature concept [20] as follows. Suppose that a user A wants to login to a server S, and thus A must register to S by the following steps.…”
Section: An Efficient Authentication Scheme Using the Self-verified Dmentioning
confidence: 99%
“…In the proposed e-payment scheme, we adopt the concept of Chen et al's self-verified signature scheme [19] to accomplish the user authentication. However, Chen et al's scheme needs to compute modular exponentiation, which is a time-consuming operation for mobile devices, so it is not suitable for mobile commerce.…”
mentioning
confidence: 99%