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.
Deterministic Sortition Guarantees Constant Committee Size for BFT Scalability
This research introduces a cryptographic sortition method providing deterministic committee size, fundamentally enhancing BFT consensus efficiency and security.
Affine One-Wayness: Post-Quantum Temporal Verification Primitive
A new post-quantum cryptographic primitive, Affine One-Wayness (AOW), enables verifiable temporal ordering in distributed systems without trusted authorities, crucial for future blockchain security.
