Efficient Privacy-Preserving Edge-based Dynamic Aggregation Query Over Crowdsensed Data
Bibliographic record
Abstract
Aggregation query, which is one of the most crucial data analysis tools applied to vehicular crowdsensed data, is expected to extract valuable insights and support smart decision-making. Meanwhile, the edge servers are deployed to cope with the escalation of service scale, which however raises privacy concerns about the query requests and reported data. Previously reported privacy-preserving aggregation query schemes are either tailored for static datasets or lack an index structure for deployed queries, which makes them impractical in vehicular crowdsensing (VCS) scenarios characterized by large volumes of real-time data and high data update frequencies. To tackle these challenges, we propose an efficient privacy-preserving edge-based dynamic aggregation query scheme with an encrypted tree-based index. Concretely, we first design two building blocks, namely the balanced spatial encoding quadtree (BSEQtree) and a predicate encryption scheme for membership testing (PEMT), which enable the edge servers to obliviously match data and queries by traversal over the encrypted BSEQtree. Based on the above blocks and arithmetic secret sharing (ASS), we construct our scheme, in which the edge servers can efficiently and securely aggregate newly reported data to related query results. Our security analysis shows the privacy preservation of our scheme, and the experiment results on a real dataset validate the efficiency of our scheme.
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.004 |
| 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.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".