Lattice-Based Folding Achieves Post-Quantum Recursive Zero-Knowledge Proofs
First lattice-based folding scheme secures recursive SNARKs against quantum attack by replacing discrete logarithm commitments with Module SIS.
Lattice Polynomial Commitments Unlock Concretely Efficient Post-Quantum Zero-Knowledge Arguments
A new lattice-based polynomial commitment scheme drastically shrinks proof size, providing the essential, quantum-safe primitive for future scalable blockchain privacy.
Lattice Commitments Secure Transparent Post-Quantum Zero-Knowledge Proofs
A new lattice-based polynomial commitment scheme secures zero-knowledge proofs against quantum attacks, eliminating the need for a trusted setup.
Lattice Polynomial Commitments Achieve Post-Quantum Transparent SNARKs
This research delivers the first efficient lattice-based polynomial commitment scheme, securing succinct arguments against quantum adversaries without a trusted setup.
Post-Quantum Cryptography Secures Blockchain Foundations against Future Quantum Threats
Integrating post-quantum algorithms into blockchain protocols provides a foundational security layer, preempting the existential threat from quantum computation.
Efficient Post-Quantum Polynomial Commitments Fortify Zero-Knowledge Scalability
Greyhound introduces the first concretely efficient lattice-based polynomial commitment scheme, unlocking post-quantum security for zk-SNARKs and blockchain scaling primitives.
Functional Adaptor Signatures Enable Private Atomic Data Sales
This new cryptographic primitive bridges the gap between atomic exchange and data privacy, allowing trustless, efficient sales of function evaluations without revealing the underlying secret data.
Lattice-Based Inner Product Argument Unlocks Post-Quantum Transparent SNARKs
The Lattice-IPA primitive achieves a succinct, transparent, and quantum-resistant proof system, fundamentally securing verifiable computation against future quantum adversaries.
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.
