ECCHSC: Computationally and Bandwidth Efficient ECC-Based Hybrid Signcryption Protocol for Secure Heterogeneous Vehicle-to-Infrastructure Communications

In recent years, secure communication and privacy‐preserving are gaining popularity because of the advent of wireless network. Certificateless cryptography (CLC) and identity‐based cryptography (IBC) have already been widely applied in the area of wireless network. Hence, to achieve secure communication from CLC to IBC, we present a heterogeneous signcryption scheme that enables a sender in the CLC to transmit a message to multi‐receiver in the IBC. Our scheme has no restrictions on the system parameters and master keys; private key generator and key generating center generate their own system parameters and master key for the IBC users and the CLC user, separately. Considering privacy‐preserving in heterogeneous communication, we show that our scheme can realize the anonymity of all receivers. Compared with other schemes, our scheme has more advantages, such as public verification and decryption fairness, which are attractive for wireless network applications. Moreover, our scheme has the indistinguishability against adaptive chosen ciphertext attacks, the existential unforgeability against adaptive chosen messages attacks, and anonymous indistinguishability of encryptions under selective‐ID, chosen ciphertext attack in the random oracle model. Copyright © 2016 John Wiley & Sons, Ltd.

To achieve heterogeneous communication from certificateless cryptography (CLC) to identity-based cryptography (IBC), we present a heterogeneous scheme that enables m senders in the CLC to transmit m message to n receivers in the IBC. In the proposed signcryption scheme, each sender is mapped to a distinct pseudo identity, so the sender’s identity privacy preservation can be guaranteed. At the same time, to ensure the receiver’s identity privacy, the identity information of all authorized recipients is mixed by the Lagrange interpolation polynomial during the signcryption process, which prevents the receiver’s identity from being exposed. Compared with existing schemes, the proposed scheme presents efficient computational overhead and is suitable for heterogeneous environments. In addition, our scheme has the indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen-message attacks in the random oracle model.

ID-CEPPA: Identity-based Computationally Efficient Privacy-Preserving Authentication scheme for vehicle-to-vehicle communications

A vehicular ad hoc network (VANET) is a special kind of mobile ad hoc networks (MANET) that supports cooperative driving among communicating cars on the roads. There are several technologies involved in implementation of wireless communication in VANETs. These technologies include 3G cellular systems, long-term evolution (LTE), LTE Advanced, IEEE 802.16, and IEEE 802.11. This chapter focuses on 802.11-based wireless communication in VANETs. It reviews some presented methods for vehicle movement path prediction, and explains some algorithms are explained for performance improvement in opportunistic networks based on the predicted vehicle movements. The chapter considers the fact that communication in VANETs can be infrastructure-based or infrastructureless. It also reviews some methods to apply the predicted vehicles' position for improving communication in infrastructure-based and infrastructureless VANETs, respectively. Opportunistic routing algorithms can be classified according to their dependency on roadside infrastructure. The chapter presents the taxonomy of opportunistic routing in VANETs.

PCAS: Cryptanalysis and improvement of pairing-free certificateless aggregate signature scheme with conditional privacy-preserving for VANETs

Beacon or safety messages are broadcasted by Vehicular Ad hoc Networks (VANETs) to disseminate network state or emergency incident information to other vehicles in the network. The freshness of information depends upon the frequent transmission of beacons. Similarly, to increase the awareness area or communicating with the distant nodes, beacons are transmitted with at high transmission power. However, increasing the beacon rate or transmission power has negative effects on information, communication efficiency because of the finite wireless link bandwidth. Therefore, different schemes have been proposed to individually control beacon's transmission power, transmission rate, or contention window at the MAC layer, or combination of those, to achieve quality beacon communication in VANETs. The latter case is called hybrid adaptive beaconing schemes. In literature, there are many hybrid adaptive beaconing schemes that control multiple communication parameters to efficiently broadcast beacon messages in VANETs. In this paper, we briefly summarize various and qualitatively compare various aspects of those schemes. The open and challenging issues are also highlighted in this paper.

Signcryption is a basic cryptographic primitive that simultaneously captures the functions of encryption and signature. To realize comprehensive information security against quantum computing attacks, lattice-based signcryption schemes have been successively proposed. However, the performance of signcryption schemes should be improved in the lattice setting. An efficient lattice-based signcryption scheme in the standard model is proposed in this paper. Under the ring learning with errors (RLWE) assumption and the ideal short integer solution (ISIS) assumption, the proposed signcryption scheme achieves indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) and existential unforgeability under an adaptive chosen-message attack (EUF-ACMA). Our scheme not only reduces the communication and computational overhead but also realizes a new design that combines the partitioning technique with the idea of tag-based key encapsulation. The performance analysis results show that our scheme is more efficient than previous lattice-based signcryption schemes in the standard model.

An efficient identity-based signature scheme without bilinear pairing for vehicle-to-vehicle communication in VANETs

Vehicular ad hoc networks (VANETs) are an increasing important paradigm for greatly enhancing roadway system efficiency and traffic safety. To widely deploy VANETs in real life, it is critical to deal with the security and privacy issues in VANETs. In this paper, we propose a certificateless conditional privacy preserving authentication (CCPPA) scheme based on certificateless cryptography and elliptic curve cryptography for secure vehicle-to-infrastructure communication in VANETs. In the proposed scheme, a roadside unit (RSU) can simultaneously verify plenty of received messages such that the total verification time may be sharply decreased. Furthermore, the security analysis indicates that the proposed scheme is provably secure in the random oracle model and fulfills all the requirements on security and privacy. To further improve efficiency, both map-to-point hash operation and bilinear pairing operation are not employed. Compared with previous CCPPA schemes, the proposed scheme prominently cuts down computation delay of message signing and verification by 66.9%–85.5% and 91.8%–93.4%, respectively, and reduces communication cost by 44.4%. Extensive simulations show that the proposed scheme is practicable and achieves prominent performances of very little average message delay and average message loss ratio and thus is appropriate for realistic applications.

Vehicular ad-hoc network (VANET) technology enables communication between vehicles, or vehicles and road-side units (RSUs) through wireless communication devices installed on the vehicles. One of the most important goals of VANETs is providing safety applications for passengers. In addition, VANETs provide comfort applications to users. Guaranteeing a reliable and stable routing protocol over VANETs is a very important step. The proposed research attempts to improve routing protocols that decrease the end-to-end delay to suit VANET communication characteristics. In addition, it proposes analysis of the end-to-end delay probability distribution. More specifically, we derive a closed-form expression for the probability distribution of the re-healing delay in a VANET conditioned on the distance between two VANET clusters. Furthermore, we propose a closed-form expression for the probability distribution of the unconditional re-healing delay. Moreover, we develop a mathematical model to calculate the probability distribution of the end-to-end delay. On the other hand, using Unmanned Aerial Vehicles (UAVs) or drones in wireless communications and Vehicular Ad-hoc Networks (VANETs) has started to attract attention. We propose a routing protocol that uses infrastructure drones for boosting VANET communications to achieve a minimum vehicle-to-drone packet delivery delay. In addition, we propose a closed-form expression for the probability distribution of the vehicle-to-drone packet delivery delay on a two-way highway. Moreover, based on that closed-form expression, we can calculate the minimum drone density (maximum separation distance between two adjacent drones) that stochastically limits the worst case of the vehicle-to-drone packet delivery delay. Furthermore, we propose a drones-active service (DAS) that is added to the location service in a VANET. This service dynamically and periodically obtains the required number of active drones based on the current highway connectivity state by obtaining the maximum distance between each two adjacent drones while satisfying a probabilistic constraint for vehicle-todrone packet delivery delay. Our analysis focuses on two-way highway VANET networks with low vehicular density. The simulation results show the accuracy of our analysis and reflect the relation between the drone density, vehicular density and speed, other VANET parameters, and the vehicle-to-drone packet delivery delay. In addition, we propose a new routing protocol called multi-copy intersection-based routing (MCIR) for vehicular ad-hoc networks (VANETs) in urban areas. MCIR is an intersectionbased routing protocol that forwards multiple copies of the packets in different road segments. Moreover, it is a beacon-less routing protocol with a carry-and-forward strategy. We show via simulation that the MCIR protocol is superior to other existing routing protocols, especially in low vehicular density scenarios. The results show that MCIR achieves a shorter end-to-end delay and a higher packet delivery ratio in urban VANET communications.

Vehicular ad-hoc networks (VANET) are the key to advancing intelligent transportation and reducing traffic congestion. Nevertheless, the rapid increase in vehicle diversity introduces numerous challenges to maintaining secure and efficient vehicle communications. To address these challenges, we propose a new identity-based encryption scheme (IBES) based on lattice-based cryptography for secure communication in VANETs. Our scheme ensures timely message receipt, preserves the confidentiality of vehicle identity, and enables rapid authentication. Our scheme protects VANET devices against both active and passive attacks in their resource-constrained environment. The formal analysis verifies that adaptively chosen message attacks cannot break the encryption scheme using the random oracle model. The informal analysis shows that the scheme meets the security goals and is strong enough to protect against side-channel, man-in-the-middle (MITM), and replay attacks. Additionally, the SCYTHER tool is used for formal security validation, and the security analysis shows that the protocol is strong against chosen-plaintext attacks. We evaluate the effectiveness of the proposed scheme against existing approaches, focusing on the security attributes offered, computation, and communication cost. Our scheme shows lower storage overhead and higher authentication efficiency than similar existing schemes. Therefore, this combination establishes the proposed scheme as an efficient and practical solution for VANET.

Reliability is an important issue for safety-critical broadcast services in vehicular ad hoc networks (VANETs). So far, most investigations of such broadcast networks focus on multihop connectivity, taking all one-hop links for granted. In this paper, four reliability metrics for one-hop broadcast communication in VANETs, including the packet reception rate (PRR), the packet delivery ratio (PDR), the node successful packet delivery probability (PDP), and the effective range (ER), are introduced and evaluated analytically and by simulations. Expressions of these reliability metrics for one-hop broadcast in IEEE-802.11-based 1-D VANETs are derived with consideration of the IEEE 802.11 distributed coordination function (DCF), the hidden terminal problem, and collisions caused by concurrent transmissions. The impacts of network parameters such as distinct transmission, carrier sensing, and interference ranges; the density of nodes in the networks; the distances of receivers to the senders; the message generation rates; the backoff window sizes; and the channel data rates on the reliability of the broadcast communication in VANETs are investigated and discussed. As an example, the proposed model is applied to the evaluation of the dedicated short-range communication (DSRC) safety-critical message propagation in a highway setting. As a result, some important observations to the design and analysis of such communication systems are provided.

VANET (Vehicular Ad hoc Networks) enable on-road wireless communication using vehicular and road-based electronic infrastructure. The services provided include routine traffic information dissemination aimed at ensuring safe driving while offering payment systems, and entertainment services are also part of VANET services. Ensuring secure, cost-effective VANET communication is a key research focus. A mechanism for unidentified message transmission, reciprocal vehicular and road base verification, as well as highly secure authentication by a trusted party, preservation of confidentiality of messages, recovery of the identity of vehicle by a trusted authority in unfortunate events, and low set up cost, is the prerequisite for trusted vehicular communication in VANET. The technique of Chameleon hashing signature provides message security with frequent changing of keys. The validation of vehicular identity in group-based communication is centralized using group signature and time stamping. This study proposes a framework combining chameleon hash signatures with group signatures to enhance VANET communication privacy, security, and cost-effectiveness.

A type of ad hoc network formed among moving vehicles that come in one another’s radio transmission range is called Vehicular Ad Hoc Network (VANET). VANET may be deployed using three architectures: pure ad hoc, WLAN and hybrid. Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) are the two modes in VANET used for communication among vehicles. These features not only distinguish a VANET from other ad hoc networks but also make these networks more exposed to attacks and increase their complexity. These networks being the primary mechanism for communication in VANETs, appropriate and timely delivery of information is of prime importance. Due to the existence of various vehicular traffic scenarios, a single category of routing protocols is not sufficient for the VANETs. Therefore, various categories of routing protocols have been tailored to meet specific kinds of routing requirements in this framework. Most significant ones are ad hoc/topology-based, position-based, geocast-based, cluster-based, broadcast-based protocols. There exist a number of attacks that apart from affecting various other parameters also affect the routing protocols in these VANETs. Most of these attacks may be launched in all the above-mentioned three architectures. But, one of the most dangerous attacks is the Sybil attack that may be initiated in pure ad hoc deployment of VANET where vehicles communicate with one another in one to one manner using carry forward approach. In this paper, with the help of illustrative example for each of the five categories of routing protocols, we show how Sybil attack affects these protocols. Considering the ad hoc scenarios in VANETs, we also discuss a prevention mechanism for the Sybil attack briefly.

VANETs are targeted to improve the traffic safety and driving experience on the road. Vehicular connectivity based communication in VANETs to be used for safety critical, safety related and non safety related messages dissemination in the networks. A key challenge in developing such network connectivity mechanism is that quickly adaptation the changes in the network topology due to the vehicular mobility. In this work we investigate the feasibility of developing the location based network connectivity for communication in VANETs in the spatial localized time domain for safety applications. The vehicular mobility and maximization of network connectivity duration between the vehicles have been identified as two important design goals in this work. However, these two goals are in conflict in nature, which makes it challenging to achieve both of these two goals in VANETs. To balance the trade-off between vehicular mobility and network connectivity, the average number of vehicle links, average link duration and connection time of each vehicle is ensured and subject to this constraint, aggregate network connectivity is maximized for efficient communication in VANETs.KeywordsMedium access control (MAC)Vehicular ad hoc networks (VANETs)Vehicular connectivity