Cryptanalysis of a simple three‐party password‐based key exchange protocol

In 3G, the server platform of IP multimedia subsystem (IMS) offers multimedia service to the multimedia clients through the exchange of authenticated key agreement (AKA) scheme. Since the IMS service is transmitted over public networks, the server and client of IMS shares a common session-key via the execution of AKA scheme to secure the communication service over a public network. Though there are some identical steps involved in the key authentication Scheme of IMS, the communication efficiencies of IMS server and client are still conciliating. Besides, it is having the issues of insecurity and session compatibility dealt with the real time transport protocol (RTP). To resolve the issues of IMS, this paper proposes three novel schemes: (1) The first scheme is multimedia server-client authentication scheme and its purpose is to mitigate the packet congestion on the networks; (2) The second scheme is traffic on background and its purpose is to analyze the signal congestion, bandwidth consumption and network utilization of the system; and (3) The last one is fault detection index and its purpose is to prevent the SIP vulnerabilities, like bye and invite. In addition, we integrate the proposed and existing authentication schemes, such as EPS-AKA, AP-AKA, UMTS-AKA, X-AKA, S-AKA and so on., in the IMS server and client environments to testify the metrics, namely round trip time, call response time, packet generation, flow analysis, RTP session, network utilization, throughput analysis, bandwidth utilization and flooding attack detection realistically.

show abstract

“…The security properties of authenticated and key agreement schemes [39][40][41][42][43][44] are as follows:…”

Section: Security Properties Of Aka Protocolmentioning

confidence: 99%

Analyzing Threefold Schemes for Enhancing Communication Channel Efficiencies Using IP Multimedia Server–Client Systems for LTE Networks

Deebak

Muthaiah

Karupuswamy

et al. 2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…To attack RSA, a cryptanalyst needs to calculate

\sqrt[2]{C} mod n

. The detailed algorithm and the potential attacks on RSA such as factorization, chosen plain text, encryption exponent, decryption exponent, plain text, modulus, timing, and power attack were studied , and the implemented results were also analyzed.…”

Section: Background Workmentioning

confidence: 99%

An efficient mixed mode and paired cipher text cryptographic algorithm for effective key distribution

Rasmi¹,

Paul²

2012

Int J Communication

View full text Add to dashboard Cite

SUMMARY Widely used asymmetric key or public key systems such as RSA, Rabin system, ElGamal system, and elliptical curve system are based on a single hard mathematical problem such as factoring or discrete logarithm. Even if these algorithms are very secure now, in the future, the situation may change and someone can solve the single hard problem easily. In this work, a new mixed mode cryptographic algorithm based on RSA is designed, which incorporates three hard mathematical problems (hidden root problem, discrete logarithms, and factoring) to make the algorithm too secure and uses the properties of both symmetric and asymmetric key algorithms. The decryption of the cipher text by the cryptanalysts is very difficult without the knowledge of secret keys, because he or she needs to solve three hard mathematical problems, which is in fact impractical. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

“…Many of these protocols have never been proven secure in any model [3,13,[17][18][19][20][21] and/or have been found to be vulnerable to some attack(s) [2,3,5,6,8,[18][19][20]23,[26][27][28][29][30][31][32]. Some protocols [2,11,12,15,23,24] have been proven secure only in a restricted model, in which the adversary is not allowed to corrupt protocol participants, and thus, no attacks by malicious clients can be captured.…”

Section: Introductionmentioning

confidence: 99%

Two-Round Password-Only Authenticated Key Exchange in the Three-Party Setting

et al. 2015

View full text Add to dashboard Cite

We present the first provably-secure three-party password-only authenticated key exchange (PAKE) protocol that can run in only two communication rounds. Our protocol is generic in the sense that it can be constructed from any two-party PAKE protocol. The protocol is proven secure in a variant of the widely-accepted model of Bellare, Pointcheval and Rogaway (2000) without any idealized assumptions on the cryptographic primitives used. We also investigate the security of the two-round, three-party PAKE protocol of Wang, Hu and Li (2010) and demonstrate that this protocol cannot achieve implicit key authentication in the presence of an active adversary.

show abstract

Cryptanalysis of a simple three‐party password‐based key exchange protocol

Cited by 49 publications

References 16 publications

Analyzing Threefold Schemes for Enhancing Communication Channel Efficiencies Using IP Multimedia Server–Client Systems for LTE Networks

Analyzing Threefold Schemes for Enhancing Communication Channel Efficiencies Using IP Multimedia Server–Client Systems for LTE Networks

An efficient mixed mode and paired cipher text cryptographic algorithm for effective key distribution

Two-Round Password-Only Authenticated Key Exchange in the Three-Party Setting

Contact Info

Product

Resources

About