Zekun Li 0009

dblp:150/2008-9 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
6since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021
YearPublicationVenuePosition
2025 The Latency Price of Threshold Cryptosystem in Blockchains
Zhuolun Xiang, Sourav Das 0001, Zekun Li 0009, Zhoujun Ma, Alexander Spiegelman
FC (2)3
2025 Shoal++: High Throughput DAG BFT Can Be Fast and Robust!
Balaji Arun, Zekun Li 0009, Florian Suri-Payer, Sourav Das 0001, Alexander Spiegelman
NSDI2
2024 Shoal: Improving DAG-BFT Latency and Robustness
Alexander Spiegelman, Balaji Arun, Rati Gelashvili, Zekun Li 0009
FC (1)4
2023 Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing
abstract
Block-STM is a parallel execution engine for smart contracts, built around the principles of Software Transactional Memory. Transactions are grouped in blocks, and every execution of the block must yield the same deterministic outcome. Block-STM further enforces that the outcome is consistent with executing transactions according to a preset order, leveraging this order to dynamically detect dependencies and avoid conflicts during speculative transaction execution. At the core of Block-STM is a novel, low-overhead collaborative scheduler of execution and validation tasks.
Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li 0009, Dahlia Malkhi, Yu Xia 0005, Runtian Zhou
PPoPP5
2021 Twins: BFT Systems Made Robust
Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li 0009, Avery Ching, Dahlia Malkhi
OPODIS5
2021 Brief Announcement: Twins - BFT Systems Made Robust
abstract
Twins is an effective strategy for generating test scenarios with Byzantine [Lamport et al., 1982] nodes in order to find flaws in Byzantine Fault Tolerant (BFT) systems. Twins finds flaws in the design or implementation of BFT protocols that may cause correctness issues. The main idea of Twins is the following: running twin instances of a node that use correct, unmodified code and share the same network identity and credentials allows to emulate most interesting Byzantine behaviors. Because a twin executes normal, unmodified node code, building Twins only requires a thin wrapper over an existing distributed system designed for Byzantine tolerance. To emulate material, interesting scenarios with Byzantine nodes, it instantiates one or more twin copies of the node, giving the twins the same identities and network credentials as the original node. To the rest of the system, the node and all its twins appear indistinguishable from a single node behaving in a "questionable" manner. This approach generates many interesting Byzantine behaviors, including equivocation, double voting, and losing internal state, while forgoing uninteresting behavior scenarios that can be filtered at the transport layer, such as producing semantically invalid messages. Building on configurations with twin nodes, Twins systematically generates scenarios with Byzantine nodes via enumeration over protocol rounds and communication patterns among nodes. Despite this being inherently exponential, one new flaw and several known flaws were materialized by Twins in the arena of BFT consensus protocols. In all cases, protocols break within fewer than a dozen protocol rounds, hence it is realistic for the Twins approach to expose the problems. In two of these cases, it took the community more than a decade to discover protocol flaws that Twins would have surfaced within minutes. Additionally, Twins has been incorporated into the continuous release testing process of a production setting (DiemBFT) in which it can execute 44M Twins-generated scenarios daily.
Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li 0009, Avery Ching, Dahlia Malkhi
DISC5