Libra, Virgo, Virgo++: Optimal Zero-Knowledge Proofs for Practical Systems
New zero-knowledge protocols, Libra, Virgo, and Virgo++, achieve optimal prover time, rapid verification, and succinct proofs, making ZKPs practical for blockchain and AI.
Succinct Oblivious Tensor Evaluation Unlocks Efficient Adaptive Cryptographic Primitives
A novel succinct oblivious tensor evaluation primitive, secured by Learning With Errors, enables adaptively-secure laconic function evaluation and optimal trapdoor hashing, advancing private verifiable computation.
Efficient Robust Threshold Signatures for Decentralized Applications
This research pioneers a robust, highly efficient threshold ECDSA protocol, dramatically reducing communication and verification costs for securing decentralized systems.
Quantum Advantage Tied to Cryptographic Security via One-Way Puzzles
Researchers establish a foundational equivalence between quantum computational superiority and cryptographic primitive security, redefining quantum advantage conditions.
EarthOL: Verifiable Human Contributions Replace Blockchain Computational Waste.
EarthOL pioneers a consensus protocol, leveraging verifiable human contributions to supplant energy-intensive computation, fostering sustainable decentralized value.
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.
ZK Rollups Enhance DeFi Scalability and Security on Ethereum
ZK Rollups scale DeFi on Ethereum via off-chain processing and on-chain verifiable proofs, boosting throughput and efficiency.
VDFs Enhance Decentralized Randomness for Robust Consensus Security
A novel Verifiable Delay Function application generates unpredictable, unbiasable randomness, fundamentally securing blockchain consensus mechanisms.
Phecda: Quantum-Resistant Transparent zkSNARKs for Verifiable Computation
This research introduces Phecda, a groundbreaking framework that constructs quantum-resistant transparent zkSNARKs through novel polynomial commitments and VOLE-in-the-Head arguments, enabling efficient, publicly verifiable computation against quantum threats.
