Linear-Time Accumulation Scheme Secures Post-Quantum Proof-Carrying Data
The WARP accumulation primitive achieves linear prover time and logarithmic verification, fundamentally unlocking post-quantum, scalable verifiable computation aggregation.
Code-Based Homomorphic Encryption Achieves Quantum-Safe Privacy-Preserving Computation
Code-based homomorphic encryption leverages NP-hard decoding problems to construct quantum-resistant privacy primitives, securing future decentralized computation.
Information-Theoretic State Compression Secures Distributed Ledger Integrity
This research introduces the State-Trellis structure, leveraging error-correcting codes to achieve constant-time, fixed-size state verification, fundamentally improving light client security.
New Linear PCP Simplifies NIZK Arguments, Significantly Improving Prover Efficiency
Researchers unveil a linear PCP for Circuit-SAT, leveraging error-correcting codes to simplify argument construction and boost SNARK prover efficiency.
Blaze Multi-Linear Commitment Scheme Accelerates SNARK Prover Time and Shrinks Proof Size
Blaze introduces a multi-linear polynomial commitment scheme using Repeat-Accumulate-Accumulate codes, dramatically speeding up ZK-SNARK provers and reducing proof size for scalable verifiable computation.
