Gestion de l'anonymat et de la traçabilité dans les réseaux véhiculaires sans fil
Bibliographic record
Abstract
Nous proposons dans ce mmoire, un protocole de scurit bas sur le changement priodique des pseudonymes de communication des vhicules.L'ide est d'viter la traabilit illgale des vhicules durant leur communication et ainsi prserver la confidentialit des donnes changes.Deux approches d'tude sont proposes.Dans la premire approche, chaque vhicule demande aprs un temps t, un nouveau pseudonyme de communication la Centrale d'Autorit (CA).Alors que dans l'approche 2, chaque vhicule gnre lui-mme, aprs un temps t, un nouveau pseudonyme de communication.Notre objectif est de dterminer un intervalle de temps au cours duquel au moins deux vhicules peuvent changer leurs pseudonymes de communication sans qu'aucun d'eux ne soit localis par un adversaire.Nous valuons dans ce travail, le taux de consommation de la bande passante en tenant compte de la vitesse moyenne des vhicules sur la route.Dans le protocole propos, nous avons dispos les RSUs de manire quidistante.En nous basant sur la plage de vitesses autorises sur la route, nous avons valu l'intervalle de temps de changement des pseudonymes de communication.Pour scuriser les messages, nous avons considr l'utilisation des algorithmes cryptographiques.Notre protocole assure l'authentification, la non-rpudiation et il permet la gestion de la vie prive des vhicules.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".