Lattice-Based SNARGs Achieve Post-Quantum Proof Efficiency
This new Ring-QAP construction uses RLWE to significantly reduce the amortized proof size of post-quantum zk-SNARKs, enabling practical verifiable computation.
Post-Quantum Lattice Commitments Secure Zero-Knowledge Proofs and Future Blockchain Scalability
Greyhound introduces the first concretely efficient lattice-based polynomial commitment, securing verifiable computation against quantum threats.
