Towards Efficient and Privacy-Preserving Versatile Task Allocation for Internet of Vehicles
Bibliographic record
Abstract
Nowadays, task allocation has attracted increasing attention in the Internet of Vehicles. To efficiently allocate tasks to suitable workers, users usually need to publish their task interests to the service provider, which brings a serious threat to users' privacy. Existing task allocation schemes either cannot comprehensively preserve user privacy (i.e., requester privacy and worker privacy) or introduce tremendous resource overhead. In this paper, we propose an efficient and privacy-preserving versatile task allocation scheme (PPVTA) for the Internet of vehicles. Specifically, we utilize the randomizable matrix multiplication technique to preserve requester privacy and worker privacy. Then, the polynomial fitting technique is leveraged to enrich the randomizable matrix multiplication to support versatile task allocation functions, such as threshold-based task allocation (PPVTA-I), conjunctive task allocation (PPVTA-II), and task allocation with bilateral access control (PPVTA-III). We formally analyze the security of our constructions to prove the security under the chosen-plain attack. Based on a prototype, experimental results demonstrate that our constructions have acceptable efficiency in practice.
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.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".