MétaCan
Menu
Back to cohort
Record W1992600298 · doi:10.1145/2815347.2815355

An Efficient Pseudonym Change Protocol Based on Trusted Neighbours for Privacy and Anonymity in VANETs

2015· article· en· W1992600298 on OpenAlexafffund
Kahina Moghraoui, Boucif Amar Bensaber

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversité du Québec à Trois-Rivières
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPseudonymAnonymityComputer scienceProtocol (science)Computer securityComputer networkWireless ad hoc networkVehicular ad hoc networkWirelessTelecommunications

Abstract

fetched live from OpenAlex

In vehicular ad hoc networks (VANETs), regular changes in private communication pseudonyms are important to avoid illegal tracking of vehicles and to ensure their anonymity. In this paper, we propose a pseudonym change protocol based on the detection of trusted neighbors. In the absence of the latter, we opted for the attribution of a lifetime to pseudonyms. This protocol triggers the pseudonym change in several vehicles at the same time, a solution that improves vehicles anonymity. In this paper, we evaluate the performance of our protocol and compare our work to that based on a triggering system that changes pseudonyms with individual behavior after a limited lifetime.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.141
Threshold uncertainty score0.891

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.043
GPT teacher head0.289
Teacher spread0.246 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations8
Published2015
Admission routes2
Has abstractyes

Explore more

Same topicVehicular Ad Hoc Networks (VANETs)French-language works237,207