A provably secure anonymous mutual authentication scheme with key agreement for SIP using ECC

Internet of Drones (IoD), designed to coordinate the access of unmanned aerial vehicles (UAVs), is a specific application of the Internet of Things (IoT). Drones are used to control airspace and offer services such as rescue, traffic surveillance, environmental monitoring, delivery and so on. However, IoD continues to suffer from privacy and security issues. Firstly, messages are transmitted over public channels in IoD environments, which compromises data security. Further, sensitive data can also be extracted from stolen mobile devices of remote users. Moreover, drones are susceptible to physical capture and manipulation by adversaries, which are called drone capture attacks. Thus, the development of a secure and lightweight authentication scheme is essential to overcoming these security vulnerabilities, even on resource-constrained drones. In 2021, Akram et al. proposed a secure and lightweight user–drone authentication scheme for drone networks. However, we discovered that Akram et al.’s scheme is susceptible to user and drone impersonation, verification table leakage, and denial of service (DoS) attacks. Furthermore, their scheme cannot provide perfect forward secrecy. To overcome the aforementioned security vulnerabilities, we propose a secure mutual authentication and key agreement scheme between user and drone pairs. The proposed scheme utilizes physical unclonable function (PUF) to give drones uniqueness and resistance against drone stolen attacks. Moreover, the proposed scheme uses a fuzzy extractor to utilize the biometrics of users as secret parameters. We analyze the security of the proposed scheme using informal security analysis, Burrows–Abadi–Needham (BAN) logic, a Real-or-Random (RoR) model, and Automated Verification of Internet Security Protocols and Applications (AVISPA) simulation. We also compared the security features and performance of the proposed scheme and the existing related schemes. Therefore, we demonstrate that the proposed scheme is suitable for IoD environments that can provide users with secure and convenient wireless communications.

The Session Initiation Protocol (SIP) is designed by taking the establishment of IP telephone network on Internet as the starting point, which has brought new vitality for the IP telephone services. SIP has faced a lot of security threats due to its own characteristics and the application environment. The vulnerability of SIP has been firstly analyzed in this paper. At the same time, based on the theory of identity authentication public key system, a scheme of SIP authentication and key agreement based on identity authentication has been also proposed in this paper. The structure is simple and the application is easy, which has greatly simplified the certificate management and maintenance as well as effectively improved the safety performance of SIP.

Session Initiation Protocol(SIP) provides authentication and session key agreement to ensure the security of the successive session.In 2010,Yoon et al.(YOON E-J,YOO K-Y.A three-factor authenticated key agreement scheme for SIP on elliptic curves.NSS '10: 4th International Conference on Network and System Security.Piscataway: IEEE,2010: 334-339.) proposed a three-factor authenticated key agreement scheme named TAKA_SIP for SIP.However,the scheme is vulnerable to insider attack,server-spoofing attack,off-line password attack,and losing token attack.Moreover,it does not provide mutual authentication.To overcome these flaws of TAKA_SIP,a new three-factor authentication scheme named ETAKA_SIP based on Elliptic Curve Cryptosystem(ECC) was proposed.ETAKA_SIP,on the basis of elliptic curve discrete logarithm problem,provides higher security than TAKA_SIP.It needs 7 elliptic curve scalar multiplication operations,1 additional operation and up to 6 Hash operations,and of high efficiency.

The development of manufacturing, communication, and computing technologies has promoted convergence of different network architectures, aiming to make full use of all resources to create valuable information. While heterogeneous integrated networks play a key role in providing highly effective and efficient solutions for medical users, they also raise various security and privacy issues. Strengthen the security and privacy protection and efficiency before transmitting sensitive data is a primary challenge to be addressed. Traditional authentication methods fail to differentiate the privacy sensitivity difference between data collected by distinct devices. We propose a secure and efficient key management scheme based on a key-exposure resistant chameleon hash function. Through adopting the devices' privacy sensitivity and users' attribute credential as two factors to establish trust between different entities, we proposed a secure and anonymous authentication protocol. The security analyses indicate that the proposed protocol can satisfy security requirements.

The session initiation protocol (SIP) is an IP-based telephony authentication mechanism for multimedia big data communications over the Internet. It is used to set up, and control voice and video calls, as well as for instant messaging. One of the concerns of this kind of open-text-based protocol is the security for user authentication. The HTTP digest-based challenge-response authentication process is used in the original SIP. However, this kind of authentication procedure is insecure and a pre-existing user configuration on the remote server is required. According to the literature, several authentication mechanisms for SIP are already devised, but none of these SIPs are robust against existing security attacks. Therefore, we design a three-factor SIP (TF-SIP) for multimedia big data communications, which is robust and flexible against existing known security issues. We show that our TF-SIP is provably secure in the random oracle model. We formally verify the mutual authentication and the freshness of the agreed session key between the user and the remote server using the BAN logic analysis. We found that the communication and computation costs are low, but the storage cost is slightly higher for our TF-SIP in comparison with other SIPs.

Session initiation protocol (SIP) is a kind of powerful and common protocols applied for the voice over internet protocol. The security and efficiency are two urgent requirements and admired properties of SIP. Recently, Hamed et al. proposed an efficient authentication and key agreement scheme for SIP. However, we demonstrate that Hamed et al.`s scheme is vulnerable to de-synchronization attack and cannot provide anonymity for users. Furthermore, we propose an improved and efficient authentication and key agreement scheme by using elliptic curve cryptosystem. Besides, we prove that the proposed scheme is provably secure by using secure formal proof based on Burrows-Abadi-Needham logic. The comparison with the relevant schemes shows that our proposed scheme has lower computation costs and can provide stronger security.

This paper proposes a secure session key exchange and mutual authentication scheme between mobile machines in WLAN-based ad hoc networks. One of the main security challenges for secure machine to machine communication is to accomplish a simple and efficient session key exchange and mutual authentication. The main idea of this paper is that non-interactive session key exchange uses the mobile machine's ID and mutual authentication without communication with an authentication server whenever a data transmission occurs between the mobile machines. The proposed scheme is secure against man-in-the-middle attack, impersonation attack, and modification attack.

The session initiation protocol (SIP) is considered as the dominant signaling protocol for Voice over IP. However, SIP authentication typically uses HTTP digest authentication, which is vulnerable to many forms of known attacks. This paper proposes a new secure SIP authentication scheme using identity-based cryptography, which provides stronger security assurances for SIP mutual authentication and session key agreement. The main merits include: (1) it achieves mutual authentication and session key agreement, (2) it does not maintain any password or verification table in the server, (3) it prevents various possible attacks induced by open networks and signaling attack for the standard SIP messages, (4) it effectively avoids the requirement of a large public key infrastructure.

Recently, Lu et al. presented a mutual authentication scheme for Session Initiation Protocol. Lu et al. claimed their scheme provides safeguard against familiar attacks and offers efficient authentication facility. However, this paper divulges that the scheme of Lu et al. is prone to server and user impersonation attacks. Additionally, the scheme of Lu et al. implicates correctness concerns. Consequently, an enhanced scheme is proposed, not only to resolve correctness concerns but also to provide robustness against server and user impersonation attacks. The proposed scheme makes use of a user‐specific secret parameter to deal with the security and correctness issues. The formal and informal security analysis proves the robustness and efficiency of the proposed scheme against all familiar attacks. Furthermore, security analysis is also substantiated through popular automated tool PROVERIF. Copyright © 2016 John Wiley & Sons, Ltd.

The session initiation protocol (SIP) is considered as the dominant signaling protocol for calls over the Internet. However, how to authenticate each other and agree on a session key has not been efficiently solved. In 2007, Wang and Zhang proposed a key agreement protocol and a new authentication and key agreement mechanism for SIP. In this paper, we prove that Wang and Zhang's key agreement protocol is insecure due to its susceptibility to the key replacement attack. Moreover, we have also realized that their protocol do not satisfy the perfect forward secrecy and known session-specific temporary information security attribute. Based on this, we propose an enhanced protocol and a new mutually authenticated key agreement protocol for SIP, Compared with the Wangand Zhang's scheme for SIP regarding the robustness and computation overheads, our scheme is more efficient and thus is more suitable for SIP.

Several protocols have been proposed to provide robust mutual authentication and key establishment for wireless local area network (WLAN). In this paper we present a new secure authenticated key agreement (SAKA) protocol that provides secure mutual authentication, key establishment and key confirmation over an untrusted network. The new protocol achieves many of the required security and performance properties. It can resist dictionary attacks mounted by either passive or active networks intruders. It can resist Man-In-The Middle attack, and Impersonate attack. It also offers perfect forward secrecy which protects past sessions and passwords against future compromise. In addition, it can resist known-key and resilience to server attack. Our proposed protocol combines techniques of challenge- response protocols with symmetric key agreement protocols and offers significantly improved performance in computational and communication load over comparably many authenticated key agreement protocols such as B-SPEKE, SRP, AMP, PAK-RY, PAK-X, SKA and LR-AKE.

An energy efficient authenticated key agreement protocol for SIP-based green VoIP networks

In mobile multi-server authentication, a client can access different servers over an insecure channel like Internet and wireless networks for numerous online applications. In the literature, several multi-server authentication schemes for mobile clients have been devised. However, most of them are insecure against ephemeral secret leakage (ESL) attack and other vulnerabilities. For mutual authentication and key agreement, mobile client and server used ephemeral secrets (random numbers) and leakage of these secrets may be possible in practice. Since these are generated by an external source that may be controlled by an adversary. Also they are generally pre-computed and stored in insecure devices. Thus, if the secrets are leaked then the session key would turn out to be known and the private keys of client and server may be compromised from the eavesdropped messages. This phenomenon is called ESL attack. To defeat the weaknesses, in this paper, we design an ESL attack-free identity-based mutual authentication and key agreement scheme for mobile multi-server environment. The proposed scheme is analyzed and proven to be provably secure in the random oracle model under the Computational Diffie---Hellman assumption.

This paper presents a novel mutual identity authentication scheme which can be applied securely in Internet of Things. Based on secure hash algorithm(SHA), feature extraction and elliptic curve cryptography(ECC), we propose an asymmetric mutual authentication scheme between the platform and the terminal node, which imposes light computation and communication cost, through security analysis it is also shown that the proposed scheme is secure and feasible for applications in the Internet of Things.

The Session Initiation Protocol (SIP) has revolutionized the way of controlling Voice over Internet Protocol (VoIP) based communication sessions over an open channel. The SIP protocol is insecure for being an open text-based protocol inherently. Different solutions have been presented in the last decade to secure the protocol. Recently, Zhang et al. authentication protocol has been proposed with a sound feature that authenticates the users without any password-verifier database using smart card. However, the scheme has a few limitations and can be made more secure and optimized regarding cost of exchanged messages, with a few modifications. Our proposed key-agreement protocol makes a use of two server secrets for robustness and is also capable of authenticating the involved parties in a single round-trip of exchanged messages. The server can now authenticate the user on the request message received, rather than the response received upon sending the challenge message, saving another round-trip of exchanged messages and hence escapes a possible denial of service attack.