Scalable Distributed Randomness via Insertion-Secure Accumulators
Research demonstrates a scalable distributed randomness beacon by enforcing verifiable inclusion of all entropy contributions using insertion-secure accumulators.
Delivery-Fairness Secures Decentralized Randomness Beacons against Time-Advantage Attacks
Introducing delivery-fairness, a new formal property, rigorously quantifies and mitigates the time-advantage vulnerability in randomness beacons, ensuring protocol-level fairness.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
Cornucopia: Accumulators and VDFs Secure Scalable Decentralized Randomness Beacons
This new Cornucopia framework combines Verifiable Delay Functions with accumulators to create a scalable, bias-resistant randomness beacon secure with only one honest participant.
Distributed Verifiable Random Function Secures Decentralized Unpredictable Public Randomness
A Distributed Verifiable Random Function combines threshold cryptography and zk-SNARKs to generate public, unpredictable, and bias-resistant randomness.
Tournament Algorithm Establishes Fair Leader Election for Decentralized Consensus
PureLottery introduces a single-elimination tournament model, leveraging VDFs to achieve provably fair, bias-resistant leader election critical for PoS security.
Streaming Random Beacons Secure Consensus with Minimal Cryptographic Overhead
STROBE introduces an NIZK-free, history-generating threshold beacon, solving the randomness scalability problem with constant-size state verification.
Cryptographic Sequential Delay Secures Decentralized Randomness Beacons
Verifiable Delay Functions introduce cryptographically enforced sequential time, preventing parallel computation and eliminating randomness bias in Proof-of-Stake leader election.
Weighted Verifiable Random Functions Scale Proof-of-Stake Randomness
Cryptographers introduce Weighted VRFs to provide cost-independent, autonomous, and fresh on-chain randomness for weighted Proof-of-Stake systems, solving a critical scalability bottleneck.
