Abstract
Distributed Computing and Networking The state-of-the-art telecommunication technologies have widely been adapted for sensing the traffic related information and collection of it. Vehicular Ad-Hoc Networks (VANETs) have emerged as a novel technology for revolutionizing the driving experiences of human. The most effective and widely recognized way for mutual authentication among entities in VANETs is digital signature scheme. The new and attractive paradigm which eliminates the use of certificates in public key cryptography and solves the key escrow problem in identity based cryptography is certificateless cryptography. A new certificateless aggregate signature scheme is proposed in the paper for VANETs with constant pairing computations. Assuming the hardness of computational Diffie-Hellman Problem, the scheme is proved to be existentially unforgeable in the random oracle model against adaptive chosen-message attacks.
Highlights
Vehicular Ad-Hoc Networks have attracted comprehensive consideration in last few years for their assurance in enhancing driving safety and revolutionizing the transportation systems
PartialKeyGen: This algorithm is performed by Key Generation Center (KGC) once for each vehicle as it enters the region of new RTA (Regional Transportation Authority)
Theorem 2 In the random oracle model, an adversary A2 exists having an advantage ε to forge a signature in a game II modelled attack within a time span t and performs queries to various oracles by making q2 queries to H2, q3 queries to H3, qp queries to RevealPublicKey, qs queries to RevealSecretKey, qps queries to RevealPseudonym and qsig queries to sign, the Computational Diffie-Hellman (CDH) problem in G1 can be solved in time t + φ(q2 + q3 + qs + qp + qps + qsig)tm where tm is the computational time for scalar multiplication in G1 with probability
Summary
Vehicular Ad-Hoc Networks have attracted comprehensive consideration in last few years for their assurance in enhancing driving safety and revolutionizing the transportation systems. The vehicle should not be able to relate the messages with its sender to ensure the private communication but at the same time; there should be mechanism termed as non-repudiation, to track the vehicles by law enforcement authorities, in case the vehicle transmits the wrong information in the network. The Certificateless Signature Scheme presented by Al-Riyami and Paterson (2003) can not be used in VANETs as it employs more computational cost in signature generation and verification processes but the high mobility of vehicles in the networks puts an urgent need to reduce the computational time as much as possible to support the reliable message delivery in the highly dynamic vehicular ad-hoc networks. The aggregate signatures enhance the network efficiency by verifying the more message signatures in a stipulated time leading to reduction in the message drop
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Discrete Mathematics & Theoretical Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
