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.
