Achieving Privacy-Preserving Vehicle Selection for Effective Content Dissemination in Smart Cities
Bibliographic record
Abstract
By integrating various connected devices, it is possible for smart cities to optimize the efficiency of various aspects of city operations. In particular, connected vehicles in smart cities, which are coordinated by Intelligent Transportation Systems (ITS), can not only enjoy enhanced safety and efficiency, but also offer content dissemination services through smart cities. In order to achieve effective content dissemination, a vehicle selection approach usually needs to be involved to select a limited number of vehicles while disseminating content to a city as wide as possible. However, such an approach inevitably requires the trajectories of vehicles, which are private to the vehicles. In this paper, to preserve the trajectory privacy of the vehicles during the vehicle selection, we propose a privacy-preserving vehicle selection scheme for effective content dissemination. Specifically, in the proposed scheme, given encrypted trajectories of n vehicles, a cloud with two non-collusive servers can select k vehicles that jointly cover an approximately optimal area of the city. Detailed security analysis and performance evaluation show that our proposed scheme can not only preserve the privacy of vehicles' trajectories, but also achieve efficient vehicle selection with an approximately optimal coverage.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| 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".