Fiat-Shamir Transformation Unsoundness Enables Practical Zero-Knowledge False Proofs
The Fiat-Shamir heuristic fails a class of succinct arguments, allowing false statements to be proven, demanding new security models.
Linear Prover Time ZK Proofs Unlock Universal Verifiable Computation
A new argument system achieves linear-time proof generation with succinct proof size, eliminating the primary computational bottleneck for ZK-rollups and verifiable computation.
Optimal Linear-Time ZK Proofs Unlock Mass Verifiable Computation
Achieving optimal linear prover time for zero-knowledge proofs fundamentally solves the scalability bottleneck for verifiable computation and ZK-Rollups.
Fiat-Shamir Transformation Vulnerable to Practical Attacks, Impacting Blockchain Security
Researchers expose a critical flaw in Fiat-Shamir, enabling false proofs in widely used systems and demanding re-evaluation of blockchain security foundations.
Libra: Optimal Prover Time, Succinct Zero-Knowledge Proofs Achieved
Libra's linear-time GKR prover and efficient zero-knowledge masking reduce proof generation, enabling practical, scalable verifiable computation.
Virgo++: Optimal Zero-Knowledge Proofs for Arbitrary Arithmetic Circuits
This research extends doubly efficient interactive proofs to arbitrary arithmetic circuits, achieving optimal linear prover time and succinct verification without requiring costly circuit layering.