Transparent Constant-Size Zero-Knowledge Proofs Eliminate Trusted Setup
This breakthrough cryptographic primitive, based on Groups of Unknown Order, yields a truly succinct zk-SNARK without a trusted setup, unlocking scalable, trustless computation.
Constant-Size Proofs Secure Distributed Verifiable Random Functions Efficiently
Cryptographers developed a Distributed Verifiable Random Function with proofs of constant size, eliminating bilinear pairings for faster, pairing-free verification.
Lattice Polynomial Commitments Achieve Quantum-Safe, Transparent, Succinct Proofs
A new lattice-based polynomial commitment, secured by the SIS problem, delivers post-quantum SNARKs with smaller proofs and no trusted setup.
DeepFold Optimizes Zero-Knowledge Proofs with Efficient Multilinear Commitments
DeepFold, a new Reed-Solomon-based polynomial commitment scheme, achieves optimal prover time and concise proofs, unlocking practical, large-scale verifiable computation.
Blockchain Designated Verifier Proofs Ensure Non-Transferable Privacy on Public Ledgers
The Blockchain Designated Verifier Proof (BDVP) uses a verifier-held trapdoor to simulate fake proofs, restoring non-transferable privacy to ZKPs on public chains.
Proof-of-Retrievability Chains Secure Stateless Client Data Access
Introducing Verifiable Retrieval Tags, a novel primitive securing data availability and enabling truly stateless light clients without complex sampling overhead.
Sublinear Vector Commitments Enable Trustless Stateless Data Availability
A new vector commitment scheme allows light clients to verify massive datasets with logarithmic communication, fundamentally solving the stateless data availability problem.
Lattice Polynomial Commitments Unlock Concretely Efficient Post-Quantum Zero-Knowledge Arguments
A new lattice-based polynomial commitment scheme drastically shrinks proof size, providing the essential, quantum-safe primitive for future scalable blockchain privacy.
Universal Updatable Proofs Secure All Zero-Knowledge Circuits
A universal and continually updatable Structured Reference String eliminates per-circuit trusted setups, unlocking composable, production-ready ZK systems.
