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.
Direct Communication Protocol Secures Data Availability Sampling Efficiency
PANDAS uses direct communication and a two-phase seeding/consolidation model to meet the 4-second DAS deadline, ensuring data availability despite malicious nodes.
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.
Distributed Verifiable Randomness Secures Consensus and On-Chain Fairness
A Distributed Verifiable Random Function, built with threshold cryptography and zk-SNARKs, creates a publicly-verifiable, un-biasable randomness primitive essential for secure leader election and MEV mitigation.
Quantifying MEV-Share Privacy with Aggregate Hints
Introduces Differentially-Private aggregate hints, enabling users to formally quantify privacy loss in MEV-Share for equitable extraction.
