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.
Lattice-Based Zero-Knowledge Proofs Secure Computation against Quantum Threat
The research introduces quantum-resistant zero-knowledge proof systems leveraging hard lattice problems, ensuring long-term privacy and verifiability for decentralized architectures.
Lattice SNARKs Achieve Quasi-Optimal Efficiency via Novel Vanishing Polynomial Commitment
A new lattice-based commitment scheme enables the first quasi-optimal, quantum-resistant SNARKs, making secure, scalable verifiable computation practical.
Vanishing Polynomial Commitments Enable Post-Quantum Succinct Arguments and Recursive Folding
A novel commitment scheme utilizing vanishing polynomials unlocks the first lattice-based linear-time prover and polylogarithmic verifier succinct arguments.
Lattice-Based Functional Commitments Secure All Functions with Transparent Post-Quantum Setup
New lattice-based functional commitments secure all functions, enabling post-quantum verifiable computation without a trusted setup.
Lattice-Based Polynomial Commitments Unlock Post-Quantum Succinct Zero-Knowledge Proofs
Greyhound, a new lattice-based polynomial commitment scheme, achieves sublinear verification and 8000X smaller proofs, ensuring quantum-safe scalability.
Efficient Post-Quantum Polynomial Commitments Unlock Scalable Zero-Knowledge Cryptography
Greyhound, a lattice-based polynomial commitment scheme, delivers post-quantum security and vastly smaller proof sizes, enabling practical, future-proof zk-SNARKs.
Lattice-Based Folding Schemes Achieve Post-Quantum Scalable Zero-Knowledge Proofs
This new lattice-based folding primitive fundamentally secures recursive zero-knowledge proofs against quantum adversaries, ensuring long-term verifiable computation integrity.
Trustless Logarithmic Commitment Secures Verifiable Computation
This new vector-based commitment achieves logarithmic proof size and trustless setup, fundamentally accelerating ZK-proof verification and scaling.
