Simplified Verifiable Secret Sharing Achieves Optimal Fault Tolerance and Efficiency
New VSS protocols fundamentally simplify the cryptographic primitive, enabling optimally fault-tolerant, publicly verifiable distributed systems with 90% less bandwidth.
Near-Optimal Communication Byzantine Broadcast under Message Adversary Model
A new Byzantine Reliable Broadcast algorithm leverages erasure codes to achieve near-optimal $O(|m| + nkappa)$ communication complexity, securing asynchronous systems against message-dropping adversaries.
Kronos: Secure Generic Sharding Consensus Optimizes Cross-Shard Communication Overhead
Kronos introduces a generic sharding consensus with a jointly managed buffer and batch certification, achieving secure, atomic cross-shard transactions with optimal overhead.
Lattice-Based DKG Secures Asynchronous Systems against Quantum Threats
Research introduces LADKG, a post-quantum DKG protocol integrating AV3S and AACS to enable scalable, publicly verifiable threshold cryptography in asynchronous BFT networks.
New Byzantine Broadcast Mechanism Achieves Optimal Communication Complexity
A novel Byzantine Reliable Broadcast protocol minimizes communication overhead to an optimal $3/2$ factor, unlocking a new frontier for scalable, bandwidth-efficient consensus.
Sparse Network Byzantine Agreement Achieves Near-Linear Fault Tolerance
A new fully-distributed protocol utilizes Byzantine Random Walks to achieve near-linear fault tolerance in sparse networks, fundamentally securing real-world peer-to-peer architectures.
