Designing secure image retrieval with SKDTree and security protocols
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
With the rise of cloud computing, traditional image retrieval techniques struggle to handle the explosive growth of image data. This study proposes a secure image retrieval method based on the secure KD-tree, integrating scale invariant feature transform for feature extraction and secure interaction protocols for encryption. Experimental results show that the improved SKDTree algorithm achieves a retrieval time of 48 ms for file 1, outperforming the spectral encoding-based subgraph indexing (62 ms) and graph isomorphism (59 ms) algorithms. Additionally, processing 40 images takes 48.63 s, significantly faster than the 68.36 s required by the spectral encoding-based approach. These findings demonstrate that the proposed method ensures efficient and accurate image retrieval. The study contributes to secure multi-server collaboration, enhancing retrieval performance in large-scale cloud environments.
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.
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.001 | 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.001 | 0.003 |
| Open science | 0.001 | 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 it