EASBF: An efficient authentication scheme over blockchain for fog computing-enabled internet of vehicles

The Internet of Vehicles (IoV) is an emerging technology that enables vehicles to communicate with their surroundings, provide convenient services, and enhance transportation systems. However, IoV networks can be vulnerable to security attacks because vehicles communicate with other IoV components through an open wireless channel. The recent related work suggested a two-factor-based lightweight authentication scheme for IoV networks. Unfortunately, we prove that the related work cannot prevent various security attacks, such as insider and ephemeral secret leakage (ESL) attacks, and fails to ensure perfect forward secrecy. To address these security weaknesses, we propose an anonymous and efficient authentication scheme with conditional privacy-preserving capabilities in IoV networks. The proposed scheme can ensure robustness against various security attacks and provide essential security features. The proposed scheme ensures conditional privacy to revoke malicious behavior in IoV networks. Moreover, our scheme uses only one-way hash functions and XOR operations, which are low-cost cryptographic operations suitable for IoV. We also prove the security of our scheme using the “Burrows–Abadi–Needham (BAN) logic”, “Real-or-Random (ROR) model”, and “Automated Validation of Internet Security Protocols and Applications (AVISPA) simulation tool”. We evaluate and compare the performance and security features of the proposed scheme with existing methods. Consequently, our scheme provides improved security and efficiency and is suitable for practical IoV networks.

When the Wireless Sensor Network (WSN) is combined with the Internet of Things (IoT), it can be employed in a wide range of applications, such as agriculture, industry 4.0, health care, smart homes, among others. Accessing the big data generated by these applications in Cloud Servers (CSs), requires higher levels of authenticity and confidentiality during communication conducted through the Internet. Signcryption is one of the most promising approaches nowadays for overcoming such obstacles, due to its combined nature, i.e., signature and encryption. A number of researchers have developed schemes to address issues related to access control in the IoT literature, however, the majority of these schemes are based on homogeneous nature. This will be neither adequate nor practical for heterogeneous IoT environments. In addition, these schemes are based on bilinear pairing and elliptic curve cryptography, which further requires additional processing time and more communication overheads that is inappropriate for real-time communication. Consequently, this paper aims to solve the above-discussed issues, we proposed an access control scheme for IoT environments using heterogeneous signcryption scheme with the efficiency and security hardiness of hyperelliptic curve. Besides the security services such as replay attack prevention, confidentiality, integrity, unforgeability, non-repudiations, and forward secrecy, the proposed scheme has very low computational and communication costs, when it is compared to existing schemes. This is primarily because of hyperelliptic curve lighter nature of key and other parameters. The AVISPA tool is used to simulate the security requirements of our proposed scheme and the results were under two backbends (Constraint Logic-based Attack Searcher (CL-b-AtSER) and On-the-Fly Model Checker (ON-t-FL-MCR)) proved to be SAFE when the presented scheme is coded in HLPSL language. This scheme was proven to be capable of preventing a variety of attacks, including confidentiality, integrity, unforgeability, non-repudiation, forward secrecy, and replay attacks.

An efficient authentication scheme with strong privacy preservation for fog-assisted vehicular ad hoc networks based on blockchain and neuro-fuzzy

Multi-server authentication technology has become more and more popular with the extensive applications of networks. Although it has brought great convenience to people’s life, security becomes a critical issue and attracts lots of attentions in both academia and industry. Over the past two decades, a series of multi-server authentication schemes without communication with the online registration center in each authentication phase using the self-certified public key cryptography have been proposed to enhance security. However, it may cause the single-point failure problem due to the centralized architecture. Besides, user revocation facility is not well resolved in these schemes. To the best of our knowledge, blockchain technology has lots of advantages, bringing a promising solution to the problems of single-point failure and user revocation compared with the traditional cryptography technologies. In this work, we apply the idea of blockchain technology to construct a privacy-awareness authentication scheme for the multi-server environment, which can achieve distributed registry and efficient revocation. Moreover, the proposed scheme not only provides multiple security requirements like mutual authentication, user anonymity and perfect forward secrecy, but also resists various kinds of malicious attacks. The security of the proposed scheme is proved by rigorous formal proof using the random oracle model. Compared with recently related schemes, the proposed scheme has better communication performance, which make it be very suitable for real-life applications.

The Internet of Vehicles (IoV) has evolved as an advancement over the conventional Vehicular Ad-hoc Networks (VANETs) in pursuing a more optimal intelligent transportation system that can provide various intelligent solutions and enable a variety of applications for vehicular traffic. Massive volumes of data are produced and communicated wirelessly among the different relayed entities in these vehicular networks, which might entice adversaries and endanger the system with a wide range of security attacks. To ensure the security of such a sensitive network, we proposed a distributed authentication mechanism for IoV based on blockchain technology as a distributed ledger with an ouroboros algorithm. Using timestamp and challenge-response mechanisms, the proposed authentication model can withstand several security attacks such as Man-in-Middle (MiM) attacks, Distributed Denial of Service (DDoS) attacks, server spoofing attacks and more. The proposed method also provides a solution for single-point failure, forward secrecy, revocability, etc. We exhibit the security of our proposed model by using formal (mathematical) analysis and informal analysis. We used Random Oracle Model to perform the mathematical analysis. In addition, we compared the communication cost, computation cost, and security of the proposed model with the related existing studies. We have verified the security of the model by using AVISPA tool simulation. The security analysis and computation analysis show that the proposed protocol is viable.

Telecare medical information systems are developed to establish an online convenient communication platform for patients and medical staff to exchange healthcare related services. Being installed on Internet, these systems are prone to different security and privacy threats, which may result in leakage of sensitive health-related data and privacy compromise of the patients. Hence, a major challenge is to establish a secure communication channel between the patients and medical servers, where parties are mutually authenticated and a session key is agreed upon and shared between them for further information exchange. Recently, Ostad-Sharif et al. presented an ECC- based anonymous authentication and key agreement method for healthcare applications. In this article, we first prove that Ostad- sharif et al.'s scheme is vulnerable to key compromise password guessing attacks and key compromise impersonation attacks. Then, we propose a secure and efficient authentication and key agreement scheme for telecare medical information systems which can provide mutual authentication and perfect forward secrecy, and resists against key compromise password guessing attacks, key compromise impersonation attacks, insider attacks, and replay attacks. The security of the proposed scheme is also proved formally with the Scyther tool.

With the maturity of Internet of Vehicles (IoV) technology and blockchain technology, numerous application scenarios have emerged, including urban Internet of Vehicles, Highway Internet of Vehicles, and Specific Area Internet of Vehicles. However, the urban Internet of Vehicles systems face data security and operational mode discretization challenges. To address these issues, we propose a data security cross-chain model for the urban Internet of Vehicles. Our model utilizes hash time lock contracts to exchange data between vehicles of the same brand and model but located in different urban areas. It also uses trusted relay chains to facilitate data exchange between vehicles of the same brands but varying models within the same urban area, thus solving the problem of difficult inter-system data exchange in the urban Internet of Vehicles. In the urban Internet of Vehicles, the transmitted data encompasses business and general data, which may have varying sensitivities. To ensure data confidentiality, we propose the HR-CP-ABE algorithm, which extends CP-ABE functionalities by incorporating hierarchical decryption and revocable vehicle attributes. And the fine-grained access control by setting different access tree structures and file access validity periods. This guarantees the confidentiality and security of urban data. Finally, experimental results demonstrate that the proposed model effectively satisfies the standards for cross-chain transactions as outlined in the Evaluation Requirements for Blockchain Application Security Technology(DB43/T 1842–2020) and Evaluation Requirements for Blockchain Network Security Technology(DB43/T 1840–2020). Additionally, our model demonstrates enhanced resilience against man-in-the-middle and replay attacks.

The potential ability to increase the capacity and safety on roads, as well as fuel economy gains has made vehicle platooning an appealing prospect. However, its use is yet to be widespread, partially due to the security concerns on it. One particular concern is the admission of fake virtual vehicles into the platoons, allowing them to wreak havoc on the platoon, which is known as a Sybil attack. In this paper, we propose a secure vehicular authentication scheme for platoon admission which is resistant to the threats of Sybil attacks. The proposed scheme offers a mutual authentication on both vehicle identity and message through a combination of a key exchange, a digital signature and an encryption scheme based on Elliptic Curve Cryptography (ECC). The scheme holds its outstanding feature to provide both perfect forward secrecy and group backward secrecy to ensure the protection of anonymity of vehicles and platoons while typical malicious attacks such as replay, and man-in-the-middle attacks can also be resisted. A formal evaluation of the security of the scheme by Canetti-Krawczyk (CK) adversary and random oracle model has been conducted to demonstrate its security functionality. Finally, the performance of the proposed scheme has been evaluated to show its efficiency.

ABSTRACTWireless body area networks (WBANs) are an important component of Medical 4.0, as they can use sensors to collect real‐time data on a patient's vital signs and transmit this information over the internet to healthcare providers, greatly improving the quality and efficiency of medical care. However, Since WBANs typically collect human physiological information, which involves personal privacy, and the collected data are usually used by medical professionals for medical diagnosis. If the transmitted data are tampered with by attackers, it may lead to errors in medical diagnosis. Therefore, we must ensure the privacy, integrity, and reliability of the data during the transmission process. As a result, identity authentication and session key negotiation become crucial for secure communication in this context. Moreover, due to the constraints of sensors in terms of memory, computation, and battery life, a lightweight and efficient authentication scheme is required. Previously, Narwal et al. proposed a scheme called SAMAKA, which allows for anonymous authentication and session key establishment between sensor nodes and a control node. However, in‐depth analysis has revealed that their scheme is vulnerable to sensor node capture attacks and does not provide session unlinkability or forward secrecy. To address the security flaws in Narwal et al.'s protocol, we have proposed an improved and untraceable mutual authentication and key negotiation scheme. We have also formally verified the security of our scheme using BAN logic and the AVISPA tool. Performance analysis shows that our scheme has significant advantages over other related schemes in terms of computational and communication costs, making it more suitable for the resource‐constrained WBAN environment.

The Wireless Sensor Networks (WSNs) are characterized by their widespread deployment due to low cost, but the WSNs are vulnerable to various types of attacks. To defend against the attacks, an effective security solution is required. However, the limits of these networks’ battery-based energy to the sensor are the most critical impediments to selecting cryptographic techniques. Consequently, finding a suitable algorithm that achieves the least energy consumption in data encryption and decryption and providing a highly protected system for data remains the fundamental problem. In this research, the main objective is to obtain data security during transmission by proposing a robust and low-power encryption algorithm, in addition, to examining security algorithms such as ECC and MD5 based on previous studies. In this research, the Energy Saving and Securing Data algorithm (ESSD) algorithm is introduced, which provides the Message Digest 5 (MD5) computation simplicity by modifying the Elliptic Curve Cryptography (ECC) under the primary condition of power consumption. These three algorithms, ECC, MD5, and ESSD, are applied to Low Energy Adaptive Clustering Hierarchy (LEACH) and Threshold-sensitive Energy Efficient Sensor Network Protocol (TEEN) hierarchical routing algorithms which are considered the most widely used in WSNs. The results of security methods under the LEACH protocol show that all nodes are dead at 456, 496, and 496, respectively, to ECC, MD5, and ESSD. The results of security methods under the TEEN protocol show that the test ends at 3743, 4815, and 4889, respectively, to ECC, MD5, and ESSD. Based on these results, the ESSD outperforms better in terms of increased security and less power consumption. In addition, it is advantageous when applied to TEEN protocol.

A lightweight anonymous cross-regional mutual authentication scheme using blockchain technology for internet of vehicles

Named Data Networking (NDN) is considered a future architecture for content distribution in the Internet of Vehicles (IoV). The primary principles of NDN, which include naming and in-network caching, are perfectly aligned with the IoV requirements for time and location independence. Despite significant research efforts, full-scale deployment remains limited due to ongoing concerns regarding trust, safety, and security within the IoV network. Moreover, traditional security algorithms proposed for IoV are complex, with high computational demands that challenge the strict real-time constraints. To minimize the computational overhead of vehicles, we proposed an RSU-empowered proxy signature scheme for NDN-based IoV. The security of the proposed scheme is proven to be Existentially Unforgeable against Adaptive Chosen-Message Attacks (EU-ACMA) under the Random Oracle Model (ROM), considering the hardness of the Hyperelliptic Curve Discrete Logarithm Problem (HCDLP). A performance analysis, which considers both computation time and communication overhead, shows that the proposed scheme effectively minimizes these factors. Besides, we applied the Multi-Criteria Decision-Making (MCDM) technique, namely Evaluation based on Distance from Average Solution (EDAS), to meet the particular need to prioritize data in IoV. The findings show that the proposed scheme performs better than those in the related literature.

Radio‐frequency identification (RFID) technology has proliferated over the last few years and being deployed as identification technology in numerous domains like intelligent transportation systems (ITS) and Internet of Vehicles (IoV) for applications like road safety, efficient traffic management, automatic toll collection, intelligent parking, etc. As RFID devices, as well as the possible domains of ITS and IoV onto which the RFID technology can be deployed, are usually resource‐constrained, thus, security and privacy become a major concern. So, public‐key cryptography becomes the better choice for enhancing the security of RFID based systems. Elliptic curve cryptography (ECC) is one of the dominant and secure asymmetric‐key cryptosystems being used for RFID security due to its smaller key size. Numerous RFID authentication schemes based on ECC have been suggested in literature, however, the majority has various serious security weaknesses. To bridge those existing security weaknesses, an enhanced ECC based light weight protocol for RFID systems has been proposed in this article. An extensive security analysis has been performed to demonstrate various secure features offered by our proposed protocol, and formal security analysis is being conducted using Automated Validation of Internet Security Protocols and Applications tool. The performance of our proposed RFID protocol has been compared with various existing RFID based security solutions on the basis of parameters, that is, computational cost, communication cost, and storage requirement. Simulation results indicate that the proposed lightweight protocol is more secure and performance efficient than the existing RFID protocols, and is well suited for practical applications.

The fast development of information technology and communication includes Internet of Things (IoT), cloud computing, Internet vehicle blockchain technology, V2G technology, and artificial intelligence. The Internet of Vehicles (IoV) is one of the application of IoT. Recently, Vasudev et al. have published a paper [1] in “IEEE Transactions on Vehicular Technology” with DOI: 10.1109/TVT.2020.2986585 in IoV environment [1]. In this paper, we reviewed Vasudev et al.’s protocol and find some of the design flaws and security features like forward secrecy, vehicle server impersonation attack, insider attack, and others weaknesses. Further, we provide some valuable suggestions for future research for authentication and key agreement protocols in V2V communication.KeywordsCryptanalysisDesign flawsV2V communicationInternet of Vehicles

With the rapid development of the Internet of Things (IoT), modern Maritime Transportation Systems (MTS) have played a crucial role in the transport industry. The various potential privacy and security concerns (such as vessels’ location tracking, message tampering, unauthorized access to data, etc.) have increased substantially in IoT-enabled MTS. Considering the above issues, we propose a secure, robust, and efficient authentication scheme for MTS based on Elliptic-Curve Cryptography (ECC) and Hash-based Message Authentication Code (HMAC) called PSAS-MTS. The proposed PSAS-MTS scheme not only monitors the vessel’s condition but also ensures protection against collisions in route management and provides safety to the vessel’s passengers. The scheme uses simple XOR, a cryptographic one-way hash, an ECC cryptosystem, and HMAC to achieve a high level of security in MTS. The formal security analysis is carried out using a well-known Real-Or-Random (ROR) model, which ensures the security harness features. A rigorous informal security analysis is also done, which ensures various privacy and security features such as mutual authentication, anonymity, forward and backward secrecy, etc. The proposed PSAS-MTS scheme resists various possible well-known active and passive security attacks. The performance analysis shows that the proposed PSAS-MTS scheme is more efficient in terms of computation and communication overheads when compared to other competitive schemes.