Privacy-Preserving Content Dissemination for Vehicular Social Networks: Challenges and Solutions
Bibliographic record
Abstract
Vehicular social networks (VSNs), viewed as the integration of traditional vehicular networks and social networks, are promising communication platforms based on the development of intelligent vehicles and deployment of intelligent transportation systems. Passengers can obtain information by searching over Internet or querying vehicles in proximity through intra-vehicle equipment. Hence, the performance of content dissemination in VSNs heavily relies on inter-vehicle communication and human behaviors. However, privacy preservation always conflicts with the usability of individual information in VSNs. The highly dynamic topology and increasing kinds of participants lead to potential threats for communication security and individual privacy. Therefore, the privacy-preserving solutions for content dissemination in VSNs have become extremely challenging, and numerous researches have been conducted recently. Compared with related surveys, this article provides the unique characteristics of privacy-preserving requirements and solutions for content dissemination in VSNs. It focuses on: 1) a comprehensive overview of content dissemination in VSNs; 2) the privacy issues and potential attacks related to content dissemination; and 3) the corresponding solutions based on privacy consideration. First, the characteristics of VSNs, content dissemination and its solutions in VSNs are revealed. Second, the privacy issues for content dissemination in the current VSN architecture are analyzed and classified according to their features. Various privacy-preserving content dissemination schemes, attempting to resist distinct attacks, are also discussed. Finally, the research challenges and open issues are summarized.
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.006 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.005 | 0.010 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.001 | 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".