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.
Lattice Polynomial Commitments Achieve Post-Quantum SNARKs without Trusted Setup
A new lattice-based polynomial commitment scheme secures zero-knowledge systems against quantum adversaries while eliminating the need for a trusted setup ceremony.
Lattice-Based DKG Secures Asynchronous Systems against Quantum Threats
Research introduces LADKG, a post-quantum DKG protocol integrating AV3S and AACS to enable scalable, publicly verifiable threshold cryptography in asynchronous BFT networks.
Lattice Cryptography Shrinks Quantum-Secure Zero-Knowledge Proofs
A new lattice-based zk-SNARK construction fundamentally shrinks proof size by over 10x, making quantum-resistant verifiable computation practical for all blockchain architectures.
New Lattice-Based Zero-Knowledge Proofs Achieve Post-Quantum Compactness
A novel polynomial product technique efficiently proves short vector norms in lattice-based cryptography, delivering compact, quantum-resistant ZKPs.
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 SNARKs Achieve Practical Post-Quantum Proof Size Reduction
A new lattice-based zkSNARK construction reduces post-quantum proof size by $10.3times$, collapsing the massive overhead that hindered quantum-secure verifiable computation.
Greyhound Achieves Post-Quantum Polynomial Commitments with Unprecedented Efficiency
A new lattice-based polynomial commitment scheme, Greyhound, delivers post-quantum security and 8000X smaller proofs, unlocking scalable verifiable computation.
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.