An efficient password security of multi-party Key Exchange Protocol using secret sharing based on ECDLP

Kar, Jayaprakash; Majhi, Banshidhar; Anwer, Mohammed Sajid

doi:10.1109/iccet.2010.5485778

Cited by 8 publications

(12 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The order of the base point P is equal to n . The standards often suggest that we select an elliptic curve with prime order and therefore any element of the group would be selected and their order will be the prime number n [5] [6]. At the end of the protocol, the communicating parties end up with the same value K which is a point on the curve.…”

Section: Elliptic Curve Diffie-helmanmentioning

confidence: 99%

“…As a result of the increased popularity of multi-party or group key agreement protocol. In the article Ingemerson et al [13], Burmester and Desmedt [10], Steiner et al [12] and Becker and Willie [11]. The two party and three party key exchange is converted to multi party protocol under passive (eavesdropping) adversary, These three provide rigorous proofs of security.…”

Section: Group Key Agreement Protocolmentioning

confidence: 99%

“…The two party and three party key exchange is converted to multi party protocol under passive (eavesdropping) adversary, These three provide rigorous proofs of security. In a dynamic group, a group key agreement scheme must ensure that the session key is updated upon every participants change so that subsequent communication sessions are protected from leaving members and previous communication sessions are protected from joining members [6].…”

Section: Group Key Agreement Protocolmentioning

confidence: 99%

“…Group key exchange protocol is an important cryptographic technique in public network where the entities can share secure information may be human-memorable password with a trusted server and establish a session key [6]. The advantages of the proposed protocol are that it does not require any server's public key in the establishment of session key.…”

Section: Introductionmentioning

confidence: 99%

“…In mobile devices such as smart card , PDA and multimedia cell phones, the processing resources, memory and power are all very constraints, but these need for secure transmission of information may increase due to the vulnerability to attackers of the publicly accessible wireless transmission channel [1] [10]. New smaller and faster probabilistic polynomial solvable security algorithms provide part of the solution.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Novel Password based Multi Party Key Agreement Protocol on Elliptic Curve

Alghazzawi¹

2012

IJCSIT

View full text Add to dashboard Cite

show abstract

Section: Elliptic Curve Diffie-helmanmentioning

confidence: 99%

Section: Group Key Agreement Protocolmentioning

confidence: 99%

Section: Group Key Agreement Protocolmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Novel Password based Multi Party Key Agreement Protocol on Elliptic Curve

Alghazzawi¹

2012

IJCSIT

View full text Add to dashboard Cite

show abstract

One-time identity-password authenticated key agreement scheme based on biometrics

Zhu

2015

Security Comm. Networks

View full text Add to dashboard Cite

Authenticated key agreement protocols, aiming at solving the problems to set up a secure channel over public Internet, can achieve authentication of the corresponding participants and confidentiality of data transmission. Nowadays, most of the authenticated key agreement protocols focus on security, efficiency, and user experience at the same time. One‐time password authenticated algorithm, which is that a hash chain can update by itself smoothly and securely through capturing the secure bit of the tip, has the feature of high‐efficient. In addition, biometrics‐based algorithm can make the scheme more secure and more amiable for users. The combination of aforementioned algorithms can lead to a high practical scheme in the universal client/server architecture. Based on these motivations, the paper firstly proposed the new concept of one‐time identity–password (OTIP), which means the identity and the password can be used only once. Then, a new robust biometrics‐based OTIP authenticated key agreement protocol is given based on the OTIP. Security of the protocol is based on the biometric authentication, a secure symmetric encryption and a secure one‐way hash function with the hash chain. At the same time, the proposed protocol can not only refrain from many consuming algorithms but also robust to many kinds of attacks and owns much excellent features. Finally, we provide the secure proof and the efficiency analysis about our proposed scheme. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Cryptanalysis and provable improvement of a chaotic maps-based mobile dynamic ID authenticated key agreement scheme

Zhu

2015

Security Comm. Networks

View full text Add to dashboard Cite

In recent years, due to the wide applications of client–server architecture, the problem of only legal users have access to use the various remote services has attracted much attention. Consequently, many chaotic maps‐based authenticated key agreement schemes using static ID have been widely used. However, static ID authentication schemes cannot provide user anonymity. It is a better choice to utilize dynamic ID authentication scheme. Recently, Lin proposed a chaotic maps‐based mobile dynamic ID authenticated key agreement scheme and proved that it was secure against existential active attacks. Unfortunately, in this paper, we show that Lin's scheme cannot resist dictionary attack, user spoofing attack, and denial of service attack. Moreover, the paper first proposed an attack method called exclusive‐or operation with pad operation leaking attack, which can lead to the worst case scenario: an adversary can get the session key without being detected. In addition, in the password‐change phase of Lin's scheme, there is no authenticated process for the user. In other words, even if anyone else inputs the two uncorrelated passwords, the mobile device will continue to update the password, which leads to the consequence that the legal user cannot log in forever. Finally, we proposed an improved protocol based on chaotic maps with provable security under the random oracle model. Compared with previous related works, the improved protocol not only can withstand existential active attacks, but also has better computational efficiency. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

An efficient password security of multi-party Key Exchange Protocol using secret sharing based on ECDLP

Cited by 8 publications

References 16 publications

A Novel Password based Multi Party Key Agreement Protocol on Elliptic Curve

A Novel Password based Multi Party Key Agreement Protocol on Elliptic Curve

One-time identity-password authenticated key agreement scheme based on biometrics

Cryptanalysis and provable improvement of a chaotic maps-based mobile dynamic ID authenticated key agreement scheme

Contact Info

Product

Resources

About