Ring Learning with Rounding Unlocks Efficient Post-Quantum Zero-Knowledge
A new ZKP of Knowledge based on the Ring Learning with Rounding assumption delivers post-quantum security with drastically reduced proof size and verification latency.
Constant-Size Polynomial Commitments Unlock Scalable Zero-Knowledge Proof Systems
This cryptographic primitive allows a constant-size commitment to any polynomial, fundamentally decoupling proof size from computation complexity.
