Lattice-Based Polynomial Commitments Achieve Post-Quantum Succinctness and Sublinear Verification
Greyhound is the first concretely efficient lattice-based polynomial commitment scheme, enabling post-quantum secure zero-knowledge proofs with sublinear verifier time.
Efficient Lattice Commitments Secure Post-Quantum Verifiable Computation
Greyhound introduces the first concretely efficient lattice-based polynomial commitment scheme, providing quantum-resistant security for all verifiable computation.
