Adaptive Byzantine Agreement Achieves Optimal Communication Complexity with Few Faults
A new Byzantine Agreement protocol achieves optimal $O(n+t cdot f)$ adaptive communication complexity, scaling cost by actual faults, not maximum potential faults.
Lattice-Based Cryptography Secures Blockchain against Quantum Computing Threat
Research formalizes the integration of quantum-resistant lattice-based signatures into blockchain architecture, ensuring long-term security against Shor's algorithm.
Formalizing MEV with an Abstract Model for Provable Blockchain Security
This paper establishes a rigorous, abstract model for Maximal Extractable Value, enabling foundational security proofs against economic manipulation in blockchains.
Formal Verification Secures Dynamic Stake DAG Consensus
Formally verifying DAG-based BFT consensus with dynamic stake establishes provable nonforking, foundational for adaptive blockchain architectures.
