Lattice-Based Commitments Achieve Post-Quantum Zero-Knowledge with Transparent Setup
A new lattice-based polynomial commitment provides post-quantum security and a transparent setup, fundamentally advancing trustless, quantum-resistant verifiable computation.
Lattice-Based Folding Achieves Post-Quantum, Incremental Succinct Proof Systems
Lattice-based folding schemes construct the first post-quantum recursive proof system, enabling quantum-secure, incrementally verifiable computation for massive data streams.
