EDBT 2026 Demo / reviewers in the wild / expert
Weili Wang 0005
dblp:28/2128-5
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 2 first-author · 3 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | WAVEN: WebAssembly Memory Virtualization for Enclaves
Weili Wang 0005, Honghan Ji, Peixuan He, Yinqian Zhang |
NDSS | 1 |
| 2025 | I Know What You Asked: Prompt Leakage via KV-Cache Sharing in Multi-Tenant LLM Serving
Guanlong Wu, Weili Wang 0005, Jianyu Niu, Yinqian Zhang |
NDSS | 4 |
| 2024 | Formally Verifying a Rollback-Prevention Protocol for TEEs
Weili Wang 0005, Jianyu Niu, Michael K. Reiter, Yinqian Zhang |
FORTE | 1 |
| 2022 | ENGRAFT: Enclave-guarded Raft on Byzantine Faulty NodesabstractThis paper presents the first critical analysis of building highly secure, performant, and confidential Byzantine fault-tolerant (BFT) consensus by integrating off-the-shelf crash fault-tolerant (CFT) protocols with trusted execution environments (TEEs). TEEs, like Intel SGX, are CPU extensions that offer applications a secure execution environment with strong integrity and confidentiality guarantees, by leveraging techniques like hardware-assisted isolation, memory encryption, and remote attestation. It has been speculated that when implementing a CFT protocol inside Intel SGX, one would achieve security properties similar to BFT. However, we show in this work that simply combining CFT with SGX does not directly yield a secure BFT protocol, given the wide range of attack vectors on SGX. We systematically study the fallacies in such a strawman design by performing model checking, and propose solutions to enforce safety and liveness. We also present ENGRAFT, a secure enclave-guarded Raft implementation that, firstly, achieves consensus on a cluster of 2f+1 machines tolerating up to f nodes exhibiting Byzantine-fault behavior (but well-behaved enclaves); secondly, offers a new abstraction of confidential consensus for privacy-preserving state machine replication; and finally, allows the reuse of a production-quality Raft implementation, BRaft, in the development of a highly performant BFT system. Weili Wang 0005, Jianyu Niu, Michael K. Reiter, Yinqian Zhang |
CCS | 1 |