Blockchain-Based Privacy-Preserving Driver Monitoring for MaaS in the Vehicular IoT
Bibliographic record
Abstract
Driving behaviors are highly relevant to automotive statuses and on-board safety, which offer compelling shreds of evidence for mobility as a service (MaaS) providers to develop personalized rental prices and insurance products. However, the direct dissemination of driving behaviors may lead to violations of identity and location privacy. In this paper, our proposed mechanism first achieves the verifiable aggregation and immutable dissemination of performance records by exploiting a blockchain with the proof-of-stake (PoS) consensus. Moreover, to acquire a driver's aggregated performance record from the blockchain, the proposed scheme first realizes quick identification with a Bloom filter and further approaches the target performance record through an oblivious transfer (OT) protocol. A performance evaluation shows that during the acquisition of the records, the computational complexity of our scheme is only related to the scale of the records contained in one transaction. However, the computational complexity of one traditional scheme without a Bloom filter depends on the scale of the records generated during each time slot. Furthermore, the computational complexity of another traditional scheme without aggregation relies on the scale of the records contained in one transaction, as well as the length of a driver's performance history. We also investigate the trade-off between the privacy level and computational complexity, and we determine the optimal number of data records in each transaction.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 source (direct Gemma or distilled Codex), 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".