Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 434

The DOI matches its Crossref record; 125 of the 125 references it cites were found in a registry or an index.

Pseudonym Schemes in Vehicular Networks: A Survey

Petit, Jonathan, Schaub, Florian, Feiri, Michael, Kargl, Frank·2015·IEEE Communications Surveys & Tutorials

Abstract

Safety-critical applications in cooperative vehicular networks require authentication of nodes and messages. Yet, privacy of individual vehicles and drivers must be maintained. Pseudonymity can satisfy both security and privacy requirements. Thus, a large body of work emerged in recent years, proposing pseudonym solutions tailored to vehicular networks. In this survey, we detail the challenges and requirements for such pseudonym mechanisms, propose an abstract pseudonym lifecycle, and give an extensive overview and categorization of the state of the art in this research area. Specifically, this survey covers pseudonym schemes based on public key and identity-based cryptography, group signatures and symmetric authentication. We compare the different approaches, give an overview of the current state of standardization, and identify open research challenges.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/comst.2014.2345420

Cites

125 of 125 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 125 references

Cited by

See all 434

Metadata

Authors
Petit, J., Schaub, F., Feiri, M., & Kargl, F.
Venue
IEEE Communications Surveys & Tutorials
Published
2015
Volume
17
Issue
1
Pages
228-255
ISSN
  • 1553-877X (ISSN-L)
  • 2373-745X
OpenAlex
W1969035815
Cited by
434
References
125
FWCI
15.03
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Pseudonym Schemes in Vehicular Networks: A Survey. https://app.cochat.ai/papers/10.1109/comst.2014.2345420
The paper
Petit, J., Schaub, F., Feiri, M., & Kargl, F. (2015). Pseudonym Schemes in Vehicular Networks: A Survey. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/comst.2014.2345420

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.