Formalizing Practical Security Risks in Zero-Knowledge Proof Implementations
This work shifts focus from theoretical SNARK security to a taxonomy of 141 real-world vulnerabilities, enabling robust, end-to-end ZK system design.
Plonky2-FRI Enables Scalable Zero-Knowledge Proof for Cryptographic Hashing Verification
This research integrates Plonky2 with FRI to generate succinct proofs for SHA-256 integrity, fundamentally decoupling computational work from verification cost.
Orion Achieves Optimal ZKP Prover Time with Polylogarithmic Proof Size
This new ZKP argument system achieves the theoretical optimum of linear prover time and succinct proof size, fundamentally unlocking scalable on-chain verification.
Transparent Succinct Proofs Eliminate Trusted Setup and Large Proof Size
A novel Vector Hash Commitment achieves constant-size, transparent proofs, resolving the critical trade-off between ZK-SNARK succinctness and ZK-STARK setup-free security.
Post-Quantum Polynomial Commitments Enable Scalable, Quantum-Resistant Blockchain Architectures
This lattice-based polynomial commitment scheme achieves post-quantum security and succinct proof size, fundamentally unlocking quantum-resistant ZK-rollups and data availability.
Vanishing Polynomial Commitments Enable Post-Quantum Succinct Arguments and Recursive Folding
A novel commitment scheme utilizing vanishing polynomials unlocks the first lattice-based linear-time prover and polylogarithmic verifier succinct arguments.
Zero-Knowledge Proofs of Quantumness Secure Quantum Computing Verification
ZKPoQ formalizes quantum completeness and classical soundness with a verifier-side zero-knowledge argument, preventing classical verifiers from exploiting quantum provers' secrets.
Zero-Knowledge Auditing Secures AI Compliance without Revealing Models
ZKMLOps leverages polynomial commitments to cryptographically prove AI model compliance, resolving the fundamental conflict between privacy and regulatory transparency.
FRIDA Enables Transparent Data Availability Sampling with Poly-Logarithmic Proofs
FRIDA uses a novel FRI-based commitment to achieve non-trusted setup data availability sampling, fundamentally improving scalability.
