An efficient certificateless aggregate signature scheme for vehicular ad-hoc networks

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 hum...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Mathematics and Theoretical Computer Science Vol. 17 no. 1; no. Distributed Computing and...; pp. 317 - 338
Main Authors: Malhi, Avleen Kaur, Batra, Shalini
Format: Journal Article
Language:English
Published: Nancy DMTCS 01.01.2015
Discrete Mathematics & Theoretical Computer Science
Subjects:
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Ad hoc networks (Computer networks)
certificateless aggregate signature scheme
certificateless cryptography
Computer Science
Cryptography
Digital signatures
Discrete Mathematics
Methods
Mobile communication systems
random oracle model
vanets
Wireless communication systems
VANETs
Certificateless Cryptography
Certificateless Aggregate Signature Scheme
Random Oracle Model
ISSN:1365-8050, 1462-7264, 1365-8050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.2106