Vector Oblivious Linear Evaluation Unlocks Efficient Zero-Knowledge Proof Systems
VOLE-ZK leverages MPC primitives to construct highly efficient, CPU-friendly zero-knowledge proofs for complex computation.
Lattice-Based Polynomial Commitments Achieve Post-Quantum Succinct Zero-Knowledge Proofs
A new lattice-based Polynomial Commitment Scheme secures zero-knowledge proofs against quantum threats while achieving sublinear verification and minimal proof size.
Lattice-Based Polynomial Commitments Achieve Post-Quantum Succinctness and Efficiency
Greyhound is the first concretely efficient polynomial commitment scheme from standard lattice assumptions, securing ZK-proof systems against future quantum threats.
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.
