Sustainable and Round-Optimized Group Authenticated Key Exchange in Vehicle Communication

Abstract

Vehicle authentication is an essential component validating the vehicle's identity and ensuring the integrity of transformed data for intelligent transport vehicles (ITS) in the vehicular ad hoc network (VANET). Easy to deploy and operate privacyenhancing vehicle authentication mechanisms are the mainstay for the widespread ITS in the VANET. Very recently, VANET security architectures are constituting by IEEE 1609.2 group, NoW project, the SeVeCom project. However, these approaches heavily depend on the consuming public key infrastructure (PKI) and certification authorities (CA). In this work, walking along the research line, we attempt to design authentication protocols with two diverse factors for Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) networks, respectively, without depending on the stumbling block PKI/CA. In addition, a smooth projective hash function (SPHF) (a.k.a., a special case of the designated-verifier zero-knowledge proof system) guarantees any recipient can confirm the authenticity and integrity of the received messages without knowing the authentication factors. Thus, to optimize the communication round, SPHF is used to design a (group) two-factor authenticated key exchange (AKE) with low-interactive communication rounds. The proof-of-concept implementation indicates that the computation and communication overheads introduced by our solution are acceptable in real-world deployments. The security of the proposed approach is validated using Bellare-Pointcheval-Rogaway (BPR) model along with the experimental evaluation and the theoretical analysis.

A Dynamic and Efficient Self-Certified Authenticated Group Key Agreement Protocol for VANET

“…But these two protocols required the assistance of the network entities such as the trusted system authority, and cannot support secure vehicle-to-vehicle (V2V) communications. Li et al [24] designed a novel AGKA protocol for V2V communications based on the Cramer-Shoup encryption, smooth projective hash functions (SPHF), and oblivious pseudorandom functions (oblivious PRF). But asymmetric encryptions and signatures are employed, and the protocol is not efficient.…”

“…We also design the Join and Leave algorithms for our protocol. To satisfy the requirements of V2V communications, Li et al [24] presented an AGKA protocol and prove the protocol's security based on the decisional Diffie-Hellman problem. But the protocol cannot realize conditional privacy.…”

“…In the Join/Leave algorithms, we assume that one user joins/leaves a group of Ref. [24] n(6|G| + 4|Zp|)…”

“…n users. We compare the computation overhead of SC-AGKA protocol with three protocols, i.e., the group authentication and key agreement protocol for 5G-enabled vehicular networks [22], the privacy-preserving AGKA protocol in fogenabled VANET [23], and the round-optimized group twofactor authenticated key establishment protocol for VANET [24]. From the comparison we know that, the protocol in [22] is lightweight because both the Group key agreement and Leave algorithms employ less scalar multiplications than our protocol, but the protocol cannot provide conditional privacy.…”

“…The protocol in [23] employs bilinear mappings, and the protocol's computation overhead is the highest of the three. The protocol in [24] fails to provide conditional privacy. Because asymmetric encryption and signatures are employed in the protocol, the overhead for computation is high.…”