Full Session Key Agreement Scheme Based on Chaotic Map in Vehicular Ad Hoc Networks

Security is considered as an important anxiety for applications which involve communication (more than two) over public networks. Group key management is one of the essential building blocks in securing group communication. Most of the researches in group key management are based on the general idea of the original Diffie–Hellman (DH) key agreement protocol. The major drawback of generalized DH for multi-party is the fact that there are expensive exponential operations to be carried out. The factors that influence the capability of a Group Key agreement (GKA) protocol are communication rounds and the computational cost. In this paper, the concept of neural cryptography, based on the mutual learning of Tree Parity Machine (TPM), is extended to operations to be carried out. The factors that influence the capability of a Group Key agreement (GKA) protocol are communication rounds and the computational cost. In this paper, the concept of neural cryptography, based on the mutual learning of Tree Parity Machine (TPM), is extended to obtain a group key. The group key has been generated for an interactive conference key agreement system, where the system authenticates the users and allows them to compute their own session key, and also it has been recognized that the neural network based GKA protocols achieve key freshness and key secrecy. The quantity demand and investment in research and development, while the other model focuses on a more realistic relationship between the quantity demand and the price.

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.

Heterogeneous networks, which can be either integrated wired and wireless networks or fully wireless networks, are convenient as they allow user nodes to be connected whenever and wherever they desire. Group key agreement (GKA) protocols are used to allow nodes in these networks to communicate securely with each other. Dynamic GKA protocols such as Join and Leave Protocol are also important since users can join and leave the network at anytime and the group key has to be changed to provide backward and forward secrecy. Denial-of-Service (DoS) attacks on GKA protocols can disrupt GKA services for secure group communications but most GKA protocols in current literature do not consider protection against DoS attacks. Furthermore, most current GKA protocols only consider outsider attacks and do not consider insider attacks. In this paper, we present three authenticated, energy-efficient and scalable GKA protocols, namely Initial GKA, Join and Leave Protocol, that provide protection against insider and DoS attacks and key confirmation properties. We also present a detection protocol to detect malicious group insiders and continue establishing a group key after blocking these malicious insiders. Unlike current communication energy analysis that uses a single energy per bit value, our communication energy analysis separates point-to-point (P2P) and broadcast communications to provide more detailed study on communications in GKA. Both the complexity and energy analysis show that the three proposed protocols are efficient, scalable and suitable for heterogeneous networks.

Group key agreement protocols are crucial for achieving secure group communications. They are designed to provide a set of users with a shared secret key to achieve cryptographic goal over a public network. When group membership changes, the session key should be refreshed efficiently and securely. Most previous group key agreement protocols need at least two rounds to establish or refresh session keys. In this paper, a dynamic authenticated group key agreement (DAGKA) protocol based on identity-based cryptography is presented. By making use of the members’ values stored in previous sessions, our Join and Leave algorithms reduce the computation and communication costs of members. In the proposed protocol, Setup and Join algorithms need one round. The session key can be refreshed without message exchange among remaining users in Leave algorithm, which makes the protocol more practical. Its security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption in random oracle model.

A group key agreement protocol can establish a secret key shared among some participants for secure group-oriented applications. Many authenticated group key agreement protocols are proposed, but some of them cannot provide user anonymity. Xiao et al. (Inf Sci 177:1136–1142, 2007) proposed an improved key agreement protocol based on chaotic maps with only a predetermined long-term key to ensure security. Guo and Zhang (Inf Sci 180:4069–4074, 2010) proposed a group key agreement protocol based on chaotic hash function, but Yoon et al. recently pointed out that Guo et al.’s protocol is vulnerable to off-line password guessing attack, stolen-verifier attack, and reflection attack. In this paper, we will propose an authenticated group key agreement protocol with user anonymity based on Chebyshev chaotic maps to resist above pointed out attacks and achieve the following properties with better performance: (i) It is suitable for multi-server and mobile environments; (ii) it achieves contributory group key agreement with user authentication; (iii) it provides mutual authentication, explicit key authentication, key confirmation, forward secrecy, and group key updating; (iv) user anonymity can simultaneously be preserved in the group key agreement procedure, which implies that identities of all participants are anonymously to outsiders; (iv) no public key certificates are used, which implies that authenticity of public keys are implicitly verified; (vi) it can also resist password guessing and stolen-verifier attacks.

In recent years, fog-based vehicular ad hoc networks (VANETs) have become a hot research topic. Due to the inherent insecurity of open wireless channels between vehicles and fog nodes, establishing session keys through authenticated key agreement (AKA) protocols is critically important for securing communications. However, existing AKA schemes face several critical challenges: (1) When a large number of vehicles initiate AKA requests within a short time window, existing schemes that process requests one by one individually incur severe signaling congestion, resulting in significant quality of service degradation. (2) Many AKA schemes incur excessive computational and communication overheads due to the adoption of computationally intensive cryptographic primitives (e.g., bilinear pairings and scalar multiplications on elliptic curve groups) and unreasonable design choices, making them unsuitable for the low-latency requirements of VANETs. To address these issues, we propose a lightweight batch AKA scheme based on fog computing. In our scheme, when a group of vehicles requests AKA sessions with the same fog node within the set time interval, the fog node aggregates these requests and, with assistance from the traffic control center, establishes session keys for all vehicles by a round of operations. It has significantly reduced the operational complexity of the entire system. Moreover, our scheme employs Lagrange interpolation and lightweight cryptographic tools, thereby significantly reducing both computational and communication overheads. Additionally, our scheme supports conditional privacy preservation and includes a revocation mechanism for malicious vehicles. Security analysis demonstrates that the proposed scheme meets the security and privacy requirements of VANETs. Performance evaluation indicates that our scheme outperforms existing state-of-the-art solutions in terms of efficiency.

A two rounds dynamic authenticated group key agreement protocol based on LWE

Since the inception of pairing-based constructions in cryptography, the authentication in group key agreement (GKA) protocol has been usually achieved by pairings. But due to high computation cost of pairing such constructions are inefficient for practical implementation, specially for low power devices. Also, in almost all such constructions leakage of both the keys- the long-term secret key and the ephemeral key has not been considered for security guarantee. In this view, construction of an efficient and secure GKA protocol is desired. In this paper, we propose an authenticated GKA protocol without pairing. We have achieved security of the proposed scheme following the most standard and recent security notion namely the EGBG model. In particular, we have proved the authenticated key exchange (AKE) security and the mutual authentication (MA) security with full forward secrecy, considering leakage of both the keys long-term and ephemeral, adopting a comparatively efficient technique, the game hopping technique. Our proposed scheme is more efficient in the view of computation and operation time with compare to the existing similar schemes, hence it is more acceptable for the tiny processors. To the best of our knowledge ours is the first pairing free balanced AGKA protocol secure in the EGBG model.

Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication. While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important. In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure. Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority. Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable. This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings. It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable. Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence. Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary.

Vehicular Ad hoc Networks (VANETs) are self-organizing wireless communication networks that allow vehicles to exchange traffic-related messages automatically with neigh-boring vehicles. The goals of VANETs are to aid road users and make traffic management more efficient. However, the open nature of the communication network medium that is used by VANETs exposes the messages in transit to security attacks and the information within to privacy breaches. Researchers proposed many security schemes in their attempt to solve the security and privacy issues in VANETs. However, most existing schemes suffer from high computation and communication overheads. We studied and analyzed the effect of one of the most common security attacks in VANETs, the replay attack. This paper presents the result of the study and analysis, as well as the survey of existing replay attack prevention schemes in VANETs.

Vehicular Ad hoc Networks (VANET) serve as an emerging technology to provides great promise for building intelligent transportation systems with convenient, enriched, and smart transportation services. Furthermore, VANET provides an intelligent platform that enables vehicles and infrastructures to share relevant information through communication, facilitating vehicle predictions of road conditions and reducing traffic accidents. Therefore, VANET faces intricacies and vulnerabilities to various security threats. Generally, to further achieve secure communication, the authentication key agreement (AKA) protocol is a crucial technology in VANET. However, the existing AKA protocols for Vehicle-to-Vehicle (V2V) communication still have some challenges. Firstly, most protocols can only achieve one-to-one identity authentication, and can not authenticate with multiple users at once, which is inefficient. Secondly, some schemes have one-to-many authentication functions but also have a linearly increasing storage cost, and their complex operations pose an expensive computational burden on resource-constrained devices. To further address these shortcomings, we propose a novel AKA protocol that utilizes the vehicle's attributes as identity, allowing for multiple identity authentication. In the extended Canetti-Krawczyk (eCK) security model, our protocol satisfies the unforgeability of messages and indistinguishability of session keys based on the hardness of the complexity assumptions. Furthermore, we conducted simulations of our protocol using ProVerif, a formal proof tool, which confirms that our protocol satisfies the security properties. To evaluate the performance of our proposal, we analyzed it using JPBC, a cryptographic library based on the Java language, as well as Veins (Omnet++ and Sumo), and the results indicate that our proposal outperforms other schemes and is suitable for deployment in high-traffic, high-density, and resource-constrained VANET scenarios.

A survey on authentication schemes in VANETs for secured communication

Vehicular Ad-Hoc Networks (VANET) are a proper subset of mobile wireless networks, where nodes are revulsive, the vehicles are armed with special electronic devices on the motherboard OBU (On Board Unit) which enables them to trasmit and receive messages from other vehicles in the VANET. Furthermore the communication between the vehicles, the VANET interface is donated by the contact points with road infrastructure. VANET is a subgroup of MANETs. Unlike the MANETs nodes, VANET nodes are moving very fast. Impound a permanent route for the dissemination of emergency messages and alerts from a danger zone is a very challenging task. Therefore, routing plays a significant duty in VANETs. decreasing network overhead, avoiding network congestion, increasing traffic congestion and packet delivery ratio are the most important issues associated with routing in VANETs. In addition, VANET network is subject to various security attacks. In base VANET systems, an algorithm is used to dicover attacks at the time of confirmation in which overhead delay occurs. This paper proposes (P-Secure) approach which is used for the detection of DoS attacks before the confirmation time. This reduces the overhead delays for processing and increasing the security in VANETs. Simulation results show that the P-Secure approach, is more efficient than OBUmodelVaNET approach in terms of PDR, e2e_delay, throughput and drop packet rate.

This chapter presents the emerging security issues in Vehicular Ad hoc Networks (VANETs) for e-business along with some of the solutions provided by the research community. The VANET will facilitate new applications for e-business that will revolutionize the driving experience, providing everything from instant, localized traffic updates to warning signals when the vehicle ahead abruptly brakes. In the emerging global economy, e-business has increasingly become a necessary component of business strategy and a strong catalyst for economic development. In near future, vehicles may be equipped with short-range radios capable of communicating with other vehicles and highway infrastructure using a VANET. However, providing security in VANETs for e-business raises privacy concerns that must be considered. The deployment of VANETs for e-business is rapidly approaching, and their success and safety will depend on viable security solutions acceptable to consumers, manufacturers and governments.

Vehicular Ad hoc Networks (VANET) broadcast messages regarding road and environmental conditions. Due to its design, VANET inadvertently introduced security and privacy issues. Many researchers have suggested various approaches to address these shortcomings as the deployment of VANET becomes more widespread. Nevertheless, these solutions could not address all the security and privacy shortcomings in VANET. Furthermore, the proposed approaches incur high costs in terms of computation due to the complexity involved in doing so sequentially. One of the significant approaches used in VANET security and privacy mitigation is identity-based schemes. This paper provides a comprehensive survey on VANETs and the entities involved, attack models, and an analysis of the security and privacy requirements for identity-based security and privacy schemes for VANETs.