Formal Verification Quantifies Algorand Consensus Robustness and Adversarial Limitations
Researchers used a process algebraic model and noninterference framework to formally verify Algorand's consensus security, revealing precise adversarial limits.
Federated Distributed Key Generation Enables Robust, Open Threshold Cryptography
FDKG introduces optional, heterogeneous participation to DKG, enabling threshold cryptography for open, large-scale, and asynchronous decentralized networks.
Asynchronous Consensus Protocol Achieves Synchronous Efficiency and Robust Liveness
QuePaxa is the first asynchronous consensus protocol to match the low latency and cost of synchronous leader-based systems under normal operation, guaranteeing liveness under attack.
Asynchronous BFT Protocol Decouples Agreement to Achieve Low Latency
Falcon protocol introduces Graded Broadcast and partial sorting to bypass BFT's high-latency agreement stage, fundamentally boosting asynchronous throughput and stability.
Randomness, Efficiency, and Adaptive Security Form a Consensus Trilemma
New research formalizes a consensus trilemma, proving no protocol can be simultaneously efficient, adaptively secure, and minimize public randomness.
Quantum Signatures Break Byzantine Fault Tolerance Bound for Consensus
Quantum Signed Byzantine Agreement achieves near-optimal 50% fault tolerance, securing future decentralized systems against classical and quantum threats.
