Secure Sequence Similarity Search on Encrypted Genomic Data
Bibliographic record
Abstract
Genomic data is being produced rapidly by both individuals and enterprises and needs to be outsourced from local machines to a cloud for better flexibility. Outsourcing also eliminates the local storage management problem for data owners. However, sensitive data must be encrypted by data owners before outsourcing to protect data privacy and security in the cloud. As genome data is huge in volume, it is challenging to execute researchers' query securely and efficiently. In this paper, we present a prefix tree based indexing algorithm for supporting similar sequence search query. We support Hamming distance as similarity measure. The proposed method adopts semi-honest adversary model for the cloud server. The security of the shared data is guaranteed through encryption while making the overall computation fast and scalable enough for real-life biomedical applications. We evaluated the efficiency of our proposed model on a database of Single-Nucleotide Polymorphism (SNP) sequences and experimental results demonstrate that a query of hamming distance k = 2 in a database of 10000 records, where each record contains 500 nucleotides, takes approximately 4 minutes.
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.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.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.009 | 0.004 |
| 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".