Sisi Duan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Sisi Duan has a total of 104 co-authors. Here are the top co-authors by number of shared publications:
- Haibin Zhang
Yangtze Delta Region Institute of Tsinghua University Zhejiang
11 shared publications - Rujia Li
Tsinghua University, Beijing, China and State Key Laboratory of Cryptography and Digital Economy Security, Beijing, China
7 shared publications - Qin Wang
CSIRO Data61, Sydney, Australia
5 shared publications - Xin Wang
Shandong University, Jinan, China
4 shared publications - Changyu Dong
Guangzhou University
3 shared publications Haibin Zhang
Yangtze Delta Region Institute of Tsinghua University, Jiaxing, Zhejiang, China
3 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6239-6253
Verifying Consensus Protocols from LLM-assisted TLA$^+$: A Case Study of Byzantine Reliable Broadcast
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6239-6253
Open AccessVerifying Consensus Protocols from LLM-assisted TLA$^+$: A Case Study of Byzantine Reliable Broadcast
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3218-3228
Greedy Attack: Breaking Finality against VeChain Proof-of-Authority Consensus Protocol
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3218-3228
Open AccessGreedy Attack: Breaking Finality against VeChain Proof-of-Authority Consensus Protocol
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3299-3310
Risk-free Selfish Mining in Hybrid Predictability Model. A Case Study on Polkadot's NPoS
Selfish mining attack is a well-known attack in blockchains where Byzantine validators collude to gain more revenue than their fair share. Prior studies show that selfish mining attack can be risk-free in the longest-chain variants of Proof-of-Stake (PoS) protocols, i.e., Byzantine validators will never be caught and do not take any risk of losing their revenue. However, it is still unclear whether risk-free selfish mining is possible for PoS in the non-global predictability model [EC 2019], where in the global unpredictability model, validators can predict the roles of all validators in advance. In this work, we study the nominated PoS protocol by Polkadot, a cryptocurrency with a market cap of over 7 billion USD (top 20 blockchains). Polkadot's PoS protocol falls into a hybrid predictability model (i.e., non-global predictability model) that has never been well studied before. We present the first two risk-free (and meanwhile profitable) selfish mining attacks against Polkadot's PoS protocol. In our attack, a mining pool with 33% Byzantine validators can launch risk-free selfish mining and earn 7.09% extra block rewards in expectation. Our experimental results using Polkadot's implementation show that our risk-free attacks achieve similar profit as conventional selfish mining attack, such as the well-known selfish mining against Bitcoin.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3299-3310
Open AccessRisk-free Selfish Mining in Hybrid Predictability Model. A Case Study on Polkadot's NPoS
Selfish mining attack is a well-known attack in blockchains where Byzantine validators collude to gain more revenue than their fair share. Prior studies show that selfish mining attack can be risk-free in the longest-chain variants of Proof-of-Stake (PoS) protocols, i.e., Byzantine validators will never be caught and do not take any risk of losing their revenue. However, it is still unclear whether risk-free selfish mining is possible for PoS in the non-global predictability model [EC 2019], where in the global unpredictability model, validators can predict the roles of all validators in advance. In this work, we study the nominated PoS protocol by Polkadot, a cryptocurrency with a market cap of over 7 billion USD (top 20 blockchains). Polkadot's PoS protocol falls into a hybrid predictability model (i.e., non-global predictability model) that has never been well studied before. We present the first two risk-free (and meanwhile profitable) selfish mining attacks against Polkadot's PoS protocol. In our attack, a mining pool with 33% Byzantine validators can launch risk-free selfish mining and earn 7.09% extra block rewards in expectation. Our experimental results using Polkadot's implementation show that our risk-free attacks achieve similar profit as conventional selfish mining attack, such as the well-known selfish mining against Bitcoin.
- 2 January 2026
- Published by Springer Nature
- p. 345-363
Towards Optimal Parallel Broadcast Under a Dishonest Majority
- 2 January 2026
- Published by Springer Nature
- p. 345-363
Towards Optimal Parallel Broadcast Under a Dishonest Majority
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 874-887
Practical Asynchronous BFT From Local Coins
Asynchronous Byzantine fault-tolerant (BFT) protocols assuming no timing assumptions are inherently more robust than their partially synchronous counterparts, but typically have much weaker security guarantees. We design new and efficient asynchronous BFT protocols matching all security guarantees of partially synchronous protocols. To achieve the goal, we have developed the local coin based BFT approach—one long deemed as being inefficient—and designed more efficient asynchronous binary agreement (ABA) protocols and their reproposable ABA (RABA) versions from local coins. Notably, our techniques on ABA and RABA allow us to build more efficient ABA protocols from common coins. We implemented four BFT protocols in a new Golang library, including BEAT, two WaterBear protocols, and FlatWorm. The WaterBear protocols use the conventional BFT workflow, while FlatWorm leverages the framework separating message transmission from consensus and significantly improves the system throughput. Via extensive evaluation, we show that our WaterBear protocols and FlatWorm are efficient under both failure-free and failure scenarios. Notably, WaterBear-QS consistently outperforms BEAT across all metrics and FlatWorm significantly outpaces WaterBear-QS. For example, with 16 replicas, FlatWorm achieves a throughput of 213.04ktx/sec—5.63x that of BEAT and 3.43x that of WaterBear-QS.
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 874-887
Practical Asynchronous BFT From Local Coins
Asynchronous Byzantine fault-tolerant (BFT) protocols assuming no timing assumptions are inherently more robust than their partially synchronous counterparts, but typically have much weaker security guarantees. We design new and efficient asynchronous BFT protocols matching all security guarantees of partially synchronous protocols. To achieve the goal, we have developed the local coin based BFT approach—one long deemed as being inefficient—and designed more efficient asynchronous binary agreement (ABA) protocols and their reproposable ABA (RABA) versions from local coins. Notably, our techniques on ABA and RABA allow us to build more efficient ABA protocols from common coins. We implemented four BFT protocols in a new Golang library, including BEAT, two WaterBear protocols, and FlatWorm. The WaterBear protocols use the conventional BFT workflow, while FlatWorm leverages the framework separating message transmission from consensus and significantly improves the system throughput. Via extensive evaluation, we show that our WaterBear protocols and FlatWorm are efficient under both failure-free and failure scenarios. Notably, WaterBear-QS consistently outperforms BEAT across all metrics and FlatWorm significantly outpaces WaterBear-QS. For example, with 16 replicas, FlatWorm achieves a throughput of 213.04ktx/sec—5.63x that of BEAT and 3.43x that of WaterBear-QS.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2892-2906
AD-MPC: Asynchronous Dynamic MPC with Guaranteed Output Delivery
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2892-2906
Open AccessAD-MPC: Asynchronous Dynamic MPC with Guaranteed Output Delivery
- 16 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12767-12780
Practical Constant-Time Asynchronous Distributed Key Generation With Improved Efficiency
We propose an expected constant-time asynchronous distributed key generation (ADKG) protocol that significantly outpaces prior protocols. Our protocol supports all desirable properties for ADKG (supporting a high threshold, private keys from field elements, and optimal resilience). At the core of our protocol is a new ADKG paradigm from weak leader election and multivalued Byzantine agreement (MBA). We have implemented our protocol and performed thus far the largest WAN evaluation using up to 202 Amazon EC2 nodes. We show that the latency of the state-of-the-art ADKG protocol due to Das, Xiang, Kokoris-Kogias, and Ren is approximately 1.6-4.8x that of our ADKG protocol.
- 16 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12767-12780
Practical Constant-Time Asynchronous Distributed Key Generation With Improved Efficiency
We propose an expected constant-time asynchronous distributed key generation (ADKG) protocol that significantly outpaces prior protocols. Our protocol supports all desirable properties for ADKG (supporting a high threshold, private keys from field elements, and optimal resilience). At the core of our protocol is a new ADKG paradigm from weak leader election and multivalued Byzantine agreement (MBA). We have implemented our protocol and performed thus far the largest WAN evaluation using up to 202 Amazon EC2 nodes. We show that the latency of the state-of-the-art ADKG protocol due to Das, Xiang, Kokoris-Kogias, and Ren is approximately 1.6-4.8x that of our ADKG protocol.
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 752-765
Transaction Fairness in Blockchains, Revisited
With the growing number of decentralized finance (DeFi) applications, transaction fairness in blockchains has gained much research interest. As a broad concept in distributed systems and blockchains, fairness has been used in different contexts, varying from ones related to the liveness of the system to ones that focus on the received order of transactions. In this work, we revisit the fairness definitions and find that existing fairness definitions are not adapted to blockchains with multiple DApps. We then provide a more generic one called verifiable fairness. Compared with prior definitions, our notion has two unique features: (i) it relaxes the ordering rules to a predicate; (ii) it enables users to independently verify if their transactions comply with the predicate for concrete applications. We also provide a scheme that achieves verifiable fairness, leveraging trusted hardware. Unlike prior works that usually design a dedicated consensus protocol to achieve fairness, our scheme can be integrated with any blockchain system. Our evaluation results on Amazon EC2 using up to 120 instances across different regions show that our construction imposes only minimal overhead on existing blockchain systems.
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (1) , 752-765
Transaction Fairness in Blockchains, Revisited
With the growing number of decentralized finance (DeFi) applications, transaction fairness in blockchains has gained much research interest. As a broad concept in distributed systems and blockchains, fairness has been used in different contexts, varying from ones related to the liveness of the system to ones that focus on the received order of transactions. In this work, we revisit the fairness definitions and find that existing fairness definitions are not adapted to blockchains with multiple DApps. We then provide a more generic one called verifiable fairness. Compared with prior definitions, our notion has two unique features: (i) it relaxes the ordering rules to a predicate; (ii) it enables users to independently verify if their transactions comply with the predicate for concrete applications. We also provide a scheme that achieves verifiable fairness, leveraging trusted hardware. Unlike prior works that usually design a dedicated consensus protocol to achieve fairness, our scheme can be integrated with any blockchain system. Our evaluation results on Amazon EC2 using up to 120 instances across different regions show that our construction imposes only minimal overhead on existing blockchain systems.
- 9 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (12) , 4138-4152
Practical Signature-Free Multivalued Validated Byzantine Agreement and Asynchronous Common Subset in Constant Time
Asynchronous common subset (ACS) is a powerful paradigm enabling applications such as Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS framework in the information-theoretic setting is due to Ben-Or, Kelmer, and Rabin (BKR, 1994). The BKR ACS protocol has been both theoretically and practically impactful. BKR ACS has an$O(\log n)$ running time (where$n$ is the number of replicas) due to the usage of$n$ parallel asynchronous binary agreement (ABA) instances, impacting both performance and scalability. Indeed, for a network of 16$\sim$ 64 replicas, the parallel ABA phase occupies about 95%$\sim$ 97% of the total runtime. A long-standing open problem is whether we can build an ACS framework with$O(1)$ time while not increasing the message or communication complexity of the BKR protocol. We resolve the open problem, presenting the first constant-time ACS protocol with$O(n^{3})$ messages in the information-theoretic and signature-free settings. Our key ingredient is the first information-theoretic and constant-time multivalued validated Byzantine agreement (MVBA) protocol. Our results can improve—asymptotically and concretely—various applications using ACS and MVBA. As an example, we implement FIN, a BFT protocol instantiated using our framework. Via a 121-server deployment on Amazon EC2, we show FIN reduces the overhead of the ABA phase to as low as 1.23% of the total runtime.- 9 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (12) , 4138-4152
Practical Signature-Free Multivalued Validated Byzantine Agreement and Asynchronous Common Subset in Constant Time
Asynchronous common subset (ACS) is a powerful paradigm enabling applications such as Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS framework in the information-theoretic setting is due to Ben-Or, Kelmer, and Rabin (BKR, 1994). The BKR ACS protocol has been both theoretically and practically impactful. BKR ACS has an$O(\log n)$ running time (where$n$ is the number of replicas) due to the usage of$n$ parallel asynchronous binary agreement (ABA) instances, impacting both performance and scalability. Indeed, for a network of 16$\sim$ 64 replicas, the parallel ABA phase occupies about 95%$\sim$ 97% of the total runtime. A long-standing open problem is whether we can build an ACS framework with$O(1)$ time while not increasing the message or communication complexity of the BKR protocol. We resolve the open problem, presenting the first constant-time ACS protocol with$O(n^{3})$ messages in the information-theoretic and signature-free settings. Our key ingredient is the first information-theoretic and constant-time multivalued validated Byzantine agreement (MVBA) protocol. Our results can improve—asymptotically and concretely—various applications using ACS and MVBA. As an example, we implement FIN, a BFT protocol instantiated using our framework. Via a 121-server deployment on Amazon EC2, we show FIN reduces the overhead of the ABA phase to as low as 1.23% of the total runtime.