Threshold Cryptography and Blockchain Secure Dual Location Query Privacy
A framework combining threshold cryptography and tokenized private chains achieves provably secure, dual-layer location and query privacy.
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.
Angelfish Consensus Unifies Leader-DAG BFT for Optimal Throughput and Latency
The Angelfish hybrid consensus protocol dynamically integrates leader-based and DAG architectures, resolving the core BFT throughput-latency trade-off.
Formal Rewrites Safely Scale Byzantine Fault Tolerance Protocols Fivefold
A new formal model and rewrite methodology prove that decoupling and partitioning can safely achieve a fivefold throughput increase for BFT protocols.
Asynchronous BFT Achieves Practical Performance through Designated Leaders
Alea-BFT combines designated leader efficiency with asynchronous resilience, creating a simple, highly performant BFT protocol that eliminates network timing assumptions.
Proof of Quantum Work Achieves Quantum-Safe, Energy-Efficient Blockchain Architecture
Proof of Quantum Work leverages quantum supremacy to secure the ledger, solving classical PoW's energy crisis and quantum-proofing the consensus layer.
Graded Broadcast Unlocks Optimal Latency for Asynchronous BFT Consensus
Falcon BFT introduces Graded Broadcast, bypassing the agreement stage to resolve high latency and instability in asynchronous consensus protocols.
Coding Techniques Achieve Near-Optimal Synchronous BFT Communication Complexity
The Hamster protocol uses coding techniques to reduce Byzantine Fault Tolerance communication to near-optimal $O(mn)$, unlocking linear throughput scaling.
Asymmetric Trust DAG Consensus Achieves Constant-Time Finality
The new common core primitive enables asynchronous DAG consensus to achieve constant-time finality under heterogeneous, asymmetric trust assumptions.
