Demo Data from EDBT 2026 / reviewers in the wild / expert
Kanqi Zhang
dblp:317/0006
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0006-8263-6329ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 2 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 |
Hardware security and side channels · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels › side-channel attack
contention-based side channels |
0.9 | 1 | 2025 | Sonar: A Hardware Fuzzing Framework to Uncover Contention Side Channels in Processors · MICRO 2025 |
Hardware security and side channels › hardware vulnerability detection
hardware fuzzing |
0.9 | 1 | 2025 | Sonar: A Hardware Fuzzing Framework to Uncover Contention Side Channels in Processors · MICRO 2025 |
Hardware security and side channels
hardware vulnerability detection |
0.9 | 1 | 2025 | Sonar: A Hardware Fuzzing Framework to Uncover Contention Side Channels in Processors · MICRO 2025 |
Hardware security and side channels
side-channel attack |
0.9 | 1 | 2025 | Sonar: A Hardware Fuzzing Framework to Uncover Contention Side Channels in Processors · MICRO 2025 |
Methods — techniques the papers use, named apart from their topics
hardware fuzzing · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Sonar: A Hardware Fuzzing Framework to Uncover Contention Side Channels in Processors
Kanqi Zhang, Peinan Li, Zelong Du, Quanchen Liu, Yongqiang Lyu 0001, Yu Jiang 0001, Dan Meng 0002, Rui Hou 0001 |
MICRO | 1 |
| 2023 | Cost-Effective Strong Consistency on Scalable Geo-Diverse Data ReplicasabstractThe Raft algorithm maintains strong consistency across data replicas in Cloud. This algorithm places nodes, i.e., leader and follower, to serve read/write requests spanning geo-diverse sites. As the workload increases, Raft shall provide proportional scale-out performance. However, traditional scale-out techniques are bottlenecked in Raft with an exponentially increased performance penalty when provisioned sites exhaust local resources. To provide scalability in Raft, this paper presents a cost-effective mechanism that enables elastic auto scaling in Raft, called BW-Raft. BW-Raft extends the original Raft with the following abstractions: (1)secretarynodes that take over expensive log synchronization operations from the leader, relaxing the performance constraint on locks. (2)observernodes that handle reads only, improving throughput for typical data intensive services. These abstractions are stateless, allowing elastic scale-out on unreliable yet cheap spot instances. In theory, we prove that BW-Raft can preserve the strong consistency guarantee from Raft at scale-out, handling 50X more nodes, compared to the original Raft. We have prototyped the BW-Raft on key-value services and evaluated it with many state-of-the-arts on Amazon EC2 and Alibaba Cloud. Our results show that within the same budget, BW-Raft incurs 5-7X less resource footprint increment than Multi-Raft. Using spot instances, BW-Raft can reduces costs by 84.5%, compared to Multi-Raft. In the real world experiments, BW-Raft improves goodput of the 95th-percentile SLO by 9X, thus, serves an alternative for distributed service scaling out with strong consistency. Yunxiao Du, Zichen Xu 0001, Kanqi Zhang, Christopher Stewart, Jiacheng Huang 0002 |
IEEE Trans. Cloud Comput. | 3 |