Sublinear MPC-in-the-Head Achieves Post-Quantum Zero-Knowledge Proof Efficiency
A novel MPC-in-the-Head construction leverages linear coding to achieve post-quantum security with sublinear proof verification, enabling fast, future-proof computation integrity.
Brakedown Achieves Post-Quantum Sublinear Polynomial Commitment without Trusted Setup
This new polynomial commitment scheme combines Reed-Solomon codes with Merkle trees, enabling post-quantum security and sublinear proof size.
Post-Quantum Signatures from Symmetric-Key ZKPs Halve Proof Size
The ZKB++ protocol converts symmetric-key primitives into post-quantum non-interactive ZK signatures, drastically reducing proof size for future security.
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.
Resumable Zero-Knowledge Proofs Drastically Cut Sequential Verification Cost
A new cryptographic primitive, resumable ZKPoK, enables sequential proof sessions to be exponentially cheaper, unlocking efficient stateful post-quantum cryptography.
