Demo Data from EDBT 2026 / reviewers in the wild / expert
Xujun Zhou
dblp:221/7935
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0001-6946-0118ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Privacy and data protection · 67% Cryptographic primitives and cryptanalysis · 33% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
privacy-preserving query processing |
0.8 | 1 | 2024 | Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024 |
Privacy and data protection › privacy-preserving query processing
range query |
0.8 | 1 | 2024 | Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024 |
Cryptographic primitives and cryptanalysis
searchable encryption |
0.8 | 1 | 2024 | Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024 |
Medical and health informatics
electronic health records |
0.2 | 1 | 2024 | Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
index tree · 1.5attribute hierarchy · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth SystemsabstractIn cloud-assisted electronic health (eHealth) systems, the exponential growth of electronic health records (EHRs) has prompted healthcare organizations to move it to the cloud. However, EHRs are encrypted before being outsourced for privacy. Although searchable encryption schemes for EHRs have been proposed, their search efficiency and functionality for massive EHRs with high-dimensional are still insufficient. In this paper, we adopt an attribute hierarchy structure for medical datasets, enabling efficient multi-dimensional range search and reducing high-dimensional EHRs to low-dimensional vectors. To further improve search efficiency, we design an index tree that require no additional storage and computational overhead, significantly improving efficiency in search, trapdoor generation, and index building. Our scheme is well-suited for large-scale medical data scenarios, especially in dealing with high-dimensional and massive datasets. Extensive experiments demonstrate the superiority of our scheme over existing solutions, particularly in large-scale medical data scenarios. Compared to the classic EDMRS scheme, our scheme has a computational overhead in index building and search that is only about 1/500 and 1/10 of EDMRS when the number of keywords and electronic health records is 3,000 and 6,000, respectively. Moreover, as medical data and keywords increase, our scheme shows slower computational overhead growth compared to EDMRS. Fei Tang 0001, Xujun Zhou, Haining Luo, Guowei Ling, Jinyong Shan, Yunpeng Xiao 0001 |
IEEE Trans. Serv. Comput. | 2 |