Secure Key Authentication Research Articles

A secure key authentication scheme for cryptosystems based on DLP in group ring

A secure key authentication scheme for cryptosystems based on DLP in group ring

A Secure Key Authentication Scheme Based on the Hardness of Solving Elliptic Curve Discrete Logarithm Problem

A key authentication scheme is a scheme that protects a user’s public key from modification and counterfeiting by an adversary. The new development and improvement of key authentication schemes should be made continuously so that the systems are safe and practical to be used. To the best of our knowledge, there is no key authentication using the elliptic curve so far. Thus, in this paper, we propose the first secure elliptic curve-based key authentication scheme with its security, relying on the difficulty of solving the elliptic curve discrete logarithm problem. We show that the proposed scheme is secure against various defined cryptographic attacks such as public keyword modification and keyword guessing attacks. Next, we analyze the computational time complexity of the algorithms by computing the number of modular operations needed in these algorithms together with asymptotical analysis of running time using O(g(n)) notation. It turns out that our scheme requires the least amount of time complexity of 203.36Tmul + Th for user registration phase, 58.12Tmul for key authentication phase, and offers less running time compared to some existing key authentication schemes.

A secure key authentication scheme for cryptosystems based on GDLP and IFP

The advancement of public-key cryptography in recent years has offered strong background support for the invention of numerous new system applications vastly employed in electronic business as well as other fields. However, that does not change the fact that the one-and-only Internet still remains open and unprotected. Therefore, for the sake of information security, confirming the legality of an entity’s public key is always critical. Typically, a key authentication scheme needs one or more authorities to authenticate keys. To make a difference, in this study, we have developed a new key authentication scheme using generalized discrete logarithm problem and integer factorization problem for cryptosystems. Although the new scheme works pretty much the same way as regular certificate-based techniques, it differs in that it needs no authority. Taking the password/secret key pair as the certificate of public key for an entity, the new key authentication technique is very simple but profoundly secure.

Analyzing secure key authentication and key agreement protocol for promising features of IP multimedia subsystem using IP multimedia server-client systems

Recently, Session Initiation Protocol (SIP) has become a prime signaling protocol for the multimedia communication systems, though none of the researchers have analyzed its promising features, namely access independence, authentication scheme verification, AKA (Authentication and Key Agreement) security properties, 3GPP security properties, signal congestion, bandwidth consumption and computation overhead using the physical multimedia server-client platform. To examine the issues realistically, the existing authentication schemes, such as UMTS AKA, EPS AKA, Cocktail AKA, S AKA, HL AKA and ZZ AKA were designed and developed in the multimedia server-client systems deployed on Linux platform. The cross-examination revealed that the existing schemes failed to satisfy the IMS (IP Multimedia Subsystem) promising features, like mutual authentication, session-key sharing, (perfect) forward secrecy and implicit-key authentication. Thus, this paper proposes a Secure-Key Authentication and Key Agreement protocol (SK AKA) to meet out the standard demands of IMS. To curtail its authentication steps, the secure authentication vector SAV computes and dispenses the generated vectors between the multimedia server-client systems in advance, through the serving call session control function SCSCF. As a result, the execution steps of UMTS AKA are annulled for the sake of accomplishment of the IMS features. In addition, the protocol of SK AKA integrates the strategies of Context Identity CID and Elliptic Curve --- Diffie Hellman (EC-DH) to resist most of the potential attacks like SIP flooding, forgery, man-in-the-middle, password guessing and key impersonation. To analyze the parameters, such as (SIP) Flooding Attack Detection Rate, End-To-End Delay of Multiple Voice Call Session, Call Success Rate, SIP Utilization, RTP Utilization, Call Response Time, Bandwidth Consumption and Signalling Congestion realistically, the proposed and existing authentication schemes have been coded and integrated in the real-time IMS client-server system. Above all, the thoroughgoing research has revealed that the proposed protocol of SK AKA accomplishes all the IMS challenges: 1. Adhere the promising features of IMS; 2. Attack resiliency; and 3. Fulfill the promising parameters of IMS, in comparison with the other existing schemes.