Quantum Signatures Break Byzantine Fault Tolerance Bound for Consensus
Quantum Signed Byzantine Agreement achieves near-optimal 50% fault tolerance, securing future decentralized systems against classical and quantum threats.
Erasure Codes Achieve Near-Optimal Communication in Adversarial Reliable Broadcast
New MBRB algorithm uses erasure coding and vector commitments to slash broadcast communication cost, enabling scalable data availability layers.
Formal Compiler Proof Secures Distributed Cryptographic Applications Synthesis
A new compiler security proof unifies four formalisms to automatically synthesize complex, secure distributed protocols from simple sequential programs, guaranteeing end-to-end security.
Compiler Proves Security for Distributed Cryptography via Foundational Unification
A formal compiler proof automatically synthesizes secure, distributed cryptographic protocols from simple centralized code, enabling robust, private systems.
Compiler Security Proof Enables Robust Distributed Cryptographic Synthesis
A novel compiler security proof unifies four theoretical models to automatically generate robust, distributed cryptographic systems from simple centralized code, fundamentally simplifying secure application development.
Asynchronous Verifiable Random Functions Achieve Optimal Leaderless BFT Consensus
AVRFs enable every node to verifiably compute the next proposer locally, eliminating leader election latency and achieving optimal asynchronous speed.
Formally Synthesizing Secure Distributed Systems from Centralized Programs
This research unifies simulation-based security with compiler techniques to automatically generate provably secure distributed cryptographic applications.
