EDBT 2026 Demo / reviewers in the wild / expert
Duo Hu
dblp:229/1294
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0003-8761-897XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 44% Memory systems · 44% Cloud and datacenter computing · 13% | |
| Network and information security
1 paper |
Privacy and data protection · 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 computation
access pattern hiding |
1.0 | 1 | 2026 | MC-ORAM: A Concurrent ORAM Scheme for Multi-User Shared Storage · IEEE Trans. Computers 2026 |
Memory systems
oblivious RAM |
1.0 | 1 | 2026 | MC-ORAM: A Concurrent ORAM Scheme for Multi-User Shared Storage · IEEE Trans. Computers 2026 |
Storage systems › secure storage › privacy-preserving storage
oblivious storage |
1.0 | 1 | 2026 | MC-ORAM: A Concurrent ORAM Scheme for Multi-User Shared Storage · IEEE Trans. Computers 2026 |
Cloud and datacenter computing
cloud storage |
0.3 | 1 | 2026 | MC-ORAM: A Concurrent ORAM Scheme for Multi-User Shared Storage · IEEE Trans. Computers 2026 |
Methods — techniques the papers use, named apart from their topics
recursion · 2.0re-encryption · 2.0client collaboration · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MC-ORAM: A Concurrent ORAM Scheme for Multi-User Shared StorageabstractThe expansion of cloud-based shared storage increases data privacy concerns. While data encryption technologies can safeguard data content, they cannot prevent the leakage of data access patterns. By re-encrypting data and changing storage location after each access, Oblivious Random Access Machine (ORAM) can effectively avoid information leakage from memory access patterns. While ORAM was initially designed for single-user applications, most existing multi-user ORAM solutions have drawbacks, such as dependence on a trusted proxy, high client storage overhead, and low throughput. To address the issues of multi-user ORAM systems, this paper explores the design of proxyless ORAM solutions in shared storage scenarios and proposes MC-ORAM, a new multi-user oblivious data storage framework. It ensures data consistency through client collaboration in a proxyless architecture, achieves higher throughput by differentiating request processing based on privacy protection requirements, and uses recursion for optimization. We implemented MC-ORAM and analyzed its performance using a variety of indicators, as well as conducting comparative evaluations against alternative schemes. The results show that, on average, MC-ORAM reduces response latency by 18.1% and improves throughput by 23.8% compared to TaoStore. Chuang Li 0004, Duo Hu, Gang Liu 0038, Yanhua Wen, Zhuo Tang |
IEEE Trans. Computers | 2 |
| 2018 | Multi-scale Attributed Graph Kernel for Image Categorization
Duo Hu, Jin Tang 0001, Bin Luo 0001 |
PRCV (3) | 1 |