Succinct Oblivious Tensor Evaluation Unlocks Efficient Adaptive Cryptographic Primitives
A novel succinct oblivious tensor evaluation primitive, secured by Learning With Errors, enables adaptively-secure laconic function evaluation and optimal trapdoor hashing, advancing private verifiable computation.
QScale: Probabilistic Chained Consensus for Moderate-Scale Systems
QScale introduces a novel probabilistic chained consensus, significantly reducing communication overhead for distributed ledgers at moderate scales.
Prioritized Committee Mechanism Achieves Optimal Asynchronous Byzantine Agreement Complexity
A new committee-based protocol achieves simultaneous optimal time, message, and communication complexity for foundational asynchronous consensus.
Lightweight Asynchronous Secret Sharing Achieves Optimal Resilience and Efficiency
New protocols for Asynchronous Verifiable Secret Sharing (AVSS) leverage lightweight primitives to achieve optimal resilience and amortized linear communication, fundamentally accelerating BFT consensus.
Consensus Randomness Trilemma Bounds Efficiency, Adaptive Security, and Entropy Cost
A new trilemma proves that efficient, adaptively secure consensus requires a logarithmic lower bound on public randomness consumption, fundamentally limiting design space.
Optimal Asynchronous Byzantine Agreement Achieves Quadratic Communication Efficiency
A novel committee-based protocol reduces asynchronous Byzantine agreement communication from cubic to quadratic, enabling practical fault-tolerant state machine replication.
Committee-Based Byzantine Agreement Protocol Slashes Communication Complexity
A novel committee-based protocol achieves optimal asynchronous Byzantine agreement, drastically reducing cubic communication overhead.
Signature-Free Asynchronous Byzantine Agreement Achieves Optimal Communication Complexity
This new signature-free asynchronous Byzantine agreement protocol achieves the theoretical optimal communication complexity for unauthenticated consensus.
Buffer Mechanism Enables Generic Sharding Consensus with Optimal Overhead
A jointly managed buffer and batch certification enable atomic cross-shard transactions with optimal overhead, creating a universal BFT sharding framework.
