Quantifying Minimal Randomness for Adaptively Secure Efficient Consensus Protocols
Foundational research establishes the tight O(log n) entropy bound required for adaptively secure, efficient Byzantine consensus, minimizing cryptographic overhead.
Validated Strong Consensus Unlocks Efficient Asynchronous BFT Blockchains
The new Validated Strong Consensus model achieves linear view changes, making asynchronous BFT protocols as efficient as partially synchronous ones.
Erasure Coding Achieves Near-Optimal Byzantine Broadcast Communication Efficiency
Researchers deployed erasure-correcting codes and vector commitments to fragment messages, drastically reducing Byzantine Reliable Broadcast communication complexity to near-optimal bounds.
Adaptive Byzantine Agreement Achieves Optimal Communication Parameterized by Actual Faults
This protocol introduces adaptive communication complexity to Byzantine Agreement, establishing tight theoretical bounds and optimizing consensus efficiency for real-world fault conditions.