Lattice-Based Arguments Achieve Succinct Post-Quantum Verification Using Homomorphic Commitments
This work delivers the first lattice-based argument with polylogarithmic verification time, resolving the trade-off between post-quantum security and SNARK succinctness.
Collaborative VDFs Enable Multi-Party Time-Lock and Fair Decentralized Protocols
Collaborative Verifiable Delay Functions introduce a new primitive for joint, publicly verifiable time-delay, securing fair multi-party mechanism design.
Polylogarithmic Polynomial Commitment Scheme Unlocks Scalable Verifiable Computation
This new polynomial commitment scheme over Galois rings achieves polylogarithmic verification, fundamentally accelerating zero-knowledge proof systems and verifiable computation.
