Building resilient, trustworthy, and scalable systems via dependable computing, decentralised systems, and security protocols.
Research: Blockchain, Consensus, Security & Privacy
🌐 jiangshanyu.github.io
• Constant latency (3Δ) in the sleepy model
• Graded Common Prefix (GCP): generic DAG finality in 2 steps (vs 4 in BFT)
• adding flexibility via extended Ebb-and-Flow
• Constant latency (3Δ) in the sleepy model
• Graded Common Prefix (GCP): generic DAG finality in 2 steps (vs 4 in BFT)
• adding flexibility via extended Ebb-and-Flow
• Prioritise liveness: support dynamic availability, but with non-constant latency
• Prioritise safety: rely on protocol-specific BFT for finality
• Prioritise liveness: support dynamic availability, but with non-constant latency
• Prioritise safety: rely on protocol-specific BFT for finality
• Removes rollback prevention from the critical path
• Matches CFT protocols in latency (4 steps) & linear message complexity
• Delivers state-of-the-art performance among TEE-assisted BFT protocols
• Removes rollback prevention from the critical path
• Matches CFT protocols in latency (4 steps) & linear message complexity
• Delivers state-of-the-art performance among TEE-assisted BFT protocols
• High performance (e.g. FlexiBFT) reduces fault tolerance
• Strong tolerance (e.g. Damysus) may suffer from rollback issues (e.g. if using SGX)
• High performance (e.g. FlexiBFT) reduces fault tolerance
• Strong tolerance (e.g. Damysus) may suffer from rollback issues (e.g. if using SGX)