Trustless Logarithmic Commitment Secures Verifiable Computation
This new vector-based commitment achieves logarithmic proof size and trustless setup, fundamentally accelerating ZK-proof verification and scaling.
Recursive Folding Unlocks Logarithmic Prover Time for Polynomial Commitments
PolyLog introduces a recursive folding primitive to reduce the zero-knowledge prover's commitment time from linear to logarithmic, enabling massive ZK-rollup scaling.
Lattice-Based Polynomial Commitments Achieve Post-Quantum Succinct Zero-Knowledge Proofs
A new lattice-based Polynomial Commitment Scheme secures zero-knowledge proofs against quantum threats while achieving sublinear verification and minimal proof size.
Vector Commitments Enable Statelessness with Compact Verkle Trees
Vector commitments replace hash-based state structures, fundamentally enabling stateless clients by generating constant-sized cryptographic proofs.
Distributed Verifiable Computation Secures Mobile Edge Computing Integrity and Efficiency
This paper introduces a distributed verifiable computation framework for mobile edge environments, ensuring integrity and low-latency for critical IoT applications.
Affine One-Wayness: Post-Quantum Temporal Verification for Distributed Systems
Affine One-Wayness (AOW) is a novel post-quantum cryptographic primitive, securing verifiable temporal ordering in distributed systems without trusted clocks.
