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.
Quantum Rewinding Secures Succinct Arguments against Quantum Adversaries
A novel quantum rewinding strategy proves IOP-based succinct arguments secure in the post-quantum era, ensuring long-term cryptographic integrity.
Zero-Knowledge Credentials from ECDSA Signatures Enable Private Identity
This ZK argument system composes Ligero with sumcheck-based verifiable computation to create privacy-preserving digital identity from existing ECDSA standards.
Poly-Universal Proofs Achieve Universal Setup and Updatable Security
This new polynomial commitment scheme decouples proof generation from circuit structure, enabling a single, secure, and continuously updatable universal setup.
Generalizing MPC-in-the-head for Superposition-Secure Quantum Zero-Knowledge Proofs
We generalize MPC-in-the-head to create post-quantum zero-knowledge arguments, securing verifiable computation against quantum superposition attacks using LWE.
Achieving Statistical Non-Malleable Zero-Knowledge in Four Rounds
A novel four-round zero-knowledge argument achieves statistical non-malleability, advancing cryptographic proof systems beyond computational security.
