Post-Quantum Threshold VRF Secures Decentralized Randomness Generation
Funder introduces a post-quantum threshold VRF compiler, securing decentralized randomness beacons against quantum threats and ensuring bias-resistant PoS leader election.
Randomness Consumption Bounds Consensus Efficiency and Adaptive Security
Formalizing a new trilemma, this research proves consensus protocols cannot be simultaneously efficient, adaptively secure, and low-entropy.
Decentralized Checkpointing Foils Proof-of-Stake Long-Range Attacks with Coin Holder Votes
Winkle introduces a decentralized checkpointing primitive, leveraging coin holder transaction-embedded votes to cryptoeconomically secure PoS history against long-range key compromise.
PoW Longest Chain Rule Offers Strongest Formal Security Guarantees over PoS
Formal analysis confirms PoW's superior security guarantees, requiring PoS designs to adopt hybrid approaches to balance safety and liveness.
Non-Interactive Proofs Cryptographically Secure Proof-of-Stake Long-Range Attacks
Non-interactive epiality proofs establish a bounded trust model, cryptographically securing Proof-of-Stake light clients against historical chain rewrites.
