MPKS: Efficient and Privacy-Enhanced Multi-Party Keyword-Oriented Similarity Query in ehealthcare
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
Cloud computing has accelerated the growth of data outsourcing query services. In this paper, a privacy-enhanced multi-party keyword-oriented similarity query (MPKS) scheme is proposed. The scheme can support the flexible scalability of multiple data sources, which makes up for the problem of insufficient research on multi-party joint queries in existing study. In addition, the scheme avoids the path pattern privacy issues that are naturally inherent in tree structures while leveraging them to speed up queries. Specifically, to support the secure and flexible scalability of data sources, a multi-key symmetric homomorphic encryption (MSHE) scheme is designed. To ensure query efficiency in multi-party environments, the scalable system model involving multiple data sources is reconstructed, and efficient parallel queries in the multi-party environment are achieved by explicitly delineating the responsibilities of each server. Under the new system model, to preserve data privacy and path pattern privacy, a privacy-preserving filtration operation (PFO) and a privacy-preserving verification operation (PVO) are designed based on MSHE, ensuring that only honest parties can obtain the filtration information on tree nodes. Extra encryption flags are added to the tree nodes and the node sequence is obfuscated to confuse the view of other servers. The aforementioned two designs constitute an oblivious tree-based traversal method. We formally prove the security of the MPKS scheme under a simulation-based real/ideal world, and the security of the MSHE protocol. Finally, comprehensive experiments demonstrate the efficiency and practicality of the proposed MPKS, which is about two orders of magnitude faster than the conventional scheme in the dataset outsourcing phase and four orders of magnitude more optimized in the query processing phase.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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.001 |
| 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