A Privacy Preserving Scheme for Nearest Neighbor Query
Bibliographic record
Abstract
In recent years, location privacy concerns that arise when using the nearest neighbor query services have gained increasing attention, as such services have become pervasive in mobile social networks devices and the IoT environments. State-of-the-art privacy preservation schemes focus on the obfuscation of the location information, which has suffered from various privacy attacks and the tradeoff of the quality of service. By noticing the fact that the user's location could be replaced by their surrounding wireless sensor infrastructures in proximity, in this paper, we propose a wireless sensor access point-based scheme for the nearest neighbor query, without using the location of the user. Then, a noise-addition-based method that preserves user's location privacy was proposed. To further strengthen the adaptability of the approach to real-world environments, several performance-enhancing methods are introduced, including an R-tree-based Noise-Data Retrieval Algorithm (RNR), and a nearest neighbor query method based on our research. Both performance and security evaluations are conducted to validate our approach. The results show the effectiveness and the practicality of our work.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".