9 papers
Multi-Round Visibility: A Post-Consensus Ordering Layer for DAG-Based BFT
Pengkun Ren, Dong Hai, Nasrin Sohrabi +1
Directed acyclic graph (DAG)-based Byzantine Fault-Tolerant (BFT) protocols achieve high throughput by decoupling dissemination from agreement and allowing many vertices to be comm…
How To Cook The Fragmented Rug Pull?
Minh Trung Tran, Nasrin Sohrabi, Zahir Tari +1
Existing rug pull detectors assume a simple workflow: the deployer keeps liquidity pool (LP) tokens and performs one or a few large sells (within a day) that collapse the pool and…
Proof-Carrying Fair Ordering: Asymmetric Verification for BFT via Incremental Graphs
Pengkun Ren, Hai Dong, Nasrin Sohrabi +2
Byzantine Fault-Tolerant (BFT) consensus protocols ensure agreement on transaction ordering despite malicious actors, but unconstrained ordering power enables sophisticated value e…
Efficient and Secure Sleepy Model for BFT Consensus
Pengkun Ren, Hai Dong, Zahir Tari +1
Byzantine Fault Tolerant (BFT) consensus protocols for dynamically available systems face a critical challenge: balancing latency and security in fluctuating node participation. Ex…
Slow is Fast! Dissecting Ethereum's Slow Liquidity Drain Scams
Minh Trung Tran, Nasrin Sohrabi, Zahir Tari +3
We identify the slow liquidity drain (SLID) scam, an insidious and highly profitable threat to decentralized finance (DeFi), posing a large-scale, persistent, and growing risk to t…
FedLAD: A Linear Algebra Based Data Poisoning Defence for Federated Learning
Qi Xiong, Hai Dong, Nasrin Sohrabi +1
Sybil attacks pose a significant threat to federated learning, as malicious nodes can collaborate and gain a majority, thereby overwhelming the system. Therefore, it is essential t…