Literature Database Entry

moghraoui2015efficient


Kahina Moghraoui and Boucif Amar Bensaber, "An Efficient Pseudonym Change Protocol Based on Trusted Neighbours for Privacy and Anonymity in VANETs," Proceedings of 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2015), 5th ACM Symposium on Development and Analysis of Intelligent Vehicular Networks and Applications (DIVANet 2015), Cancún, Mexico, November 2015, pp. 93–99.


Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Kahina Moghraoui
Boucif Amar Bensaber

BibTeX reference

@inproceedings{moghraoui2015efficient,
    author = {Moghraoui, Kahina and Amar Bensaber, Boucif},
    doi = {10.1145/2815347.2815355},
    title = {{An Efficient Pseudonym Change Protocol Based on Trusted Neighbours for Privacy and Anonymity in VANETs}},
    pages = {93--99},
    publisher = {ACM},
    isbn = {978-1-4503-3760-1},
    address = {Canc{\'{u}}n, Mexico},
    booktitle = {18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2015), 5th ACM Symposium on Development and Analysis of Intelligent Vehicular Networks and Applications (DIVANet 2015)},
    month = {11},
    year = {2015},
   }
   
   

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.