Literature Database Entry

adigun2013protocol

A. Adigun, B.A. Bensaber and I. Biskri, "Protocol of change pseudonyms for VANETs," Proceedings of 38th IEEE Conference on Local Computer Networks (LCN 2013), Workshops, Sydney, Australia, October 2013, pp. 162–167.

Abstract

communications, We propose in this paper a security protocol based on periodic change of pseudonyms. The idea is to avoid illegal traceability of vehicles during their and privacy, preserve their and confidential information. Two different approaches are proposed. In the first approach, each vehicle asks the central authority a new communication pseudonym after a time t. While in the second approach, each vehicle generates itself after a time t, a new communication pseudonym. Our objective is to permit at least two vehicles to change their pseudonym in the same time interval. We evaluate in this work, the bandwidth used by considering the vehicles speed in each approach. The proposed protocol is based on equidistant distribution of the road side unit and pseudonyms, uses the average of speed permitted on the road to evaluate lifetime t of the communication's and asymmetric, certificates. The exchange of information is based on and scheme, symmetric cryptography and it uses hash function. Our protocol provides authentication, non-repudiation and privacy.,

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

A. Adigun
B.A. Bensaber
I. Biskri

BibTeX reference

@inproceedings{adigun2013protocol,
    author = {Adigun, A. and Bensaber, B.A. and Biskri, I.},
    doi = {10.1109/LCNW.2013.6758514},
    title = {{Protocol of change pseudonyms for VANETs}},
    pages = {162--167},
    publisher = {IEEE},
    address = {Sydney, Australia},
    booktitle = {38th IEEE Conference on Local Computer Networks (LCN 2013), Workshops},
    month = {10},
    year = {2013},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.