Straightline Extractors Prove Recursive Zero-Knowledge Security without Loss
New analysis proves recursive SNARK composition incurs no security loss, formally validating the foundational security model for all scalable zero-knowledge rollups.
Black-Box Commit-and-Prove SNARKs Accelerate Verifiable Machine Learning Efficiency
Artemis introduces a black-box Commit-and-Prove SNARK architecture, radically cutting prover time by decoupling commitment checks from the core verifiable computation.
Democratic Randomness Protocol Eliminates Leader Bottlenecks for Scalability
Kleroterion, a democratic random beacon using Pinakion PVSS, achieves linear complexity by distributing input sharing, enabling scalable, bias-resistant randomness.
Collaborative Zero-Knowledge Proofs Secure Distributed Secrets Efficiently
This research introduces Collaborative zk-SNARKs, a cryptographic primitive allowing distributed parties to prove a statement about their collective secret data without centralization, achieving near-single-prover efficiency.
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.
Rigorous Extractability Proofs Fortify KZG Polynomial Commitment Schemes
This work introduces a novel framework to rigorously prove KZG polynomial extractability, ensuring cryptographic integrity for scalable blockchain systems by formalizing knowledge proofs.
Formal Verification Secures Polynomial Commitment Schemes
Rigorous formal verification of cryptographic primitives like KZG establishes foundational security, ensuring the integrity of core blockchain mechanisms.
