SmallWood: Hash-Based Commitments Achieve Post-Quantum Zero-Knowledge for Small Instances
SmallWood introduces a post-quantum, hash-based commitment scheme, dramatically shrinking proof sizes for common, small-scale verifiable computation.
WARP: Linear Accumulation Unlocks Post-Quantum Scalable Verifiable Computation
Introducing WARP, a hash-based accumulation scheme achieving linear prover time and logarithmic verification, radically accelerating recursive proof systems.
Optimal Asynchronous Consensus Resilience Using Complexity-Efficient Hash-Based Agreement
A new hash-based Multi-Valued Byzantine Agreement protocol achieves near-optimal fault tolerance with constant time complexity, enabling robust asynchronous consensus.
Lattice-Based Cryptography Secures Blockchain against Quantum Computing Threat
Research formalizes the integration of quantum-resistant lattice-based signatures into blockchain architecture, ensuring long-term security against Shor's algorithm.
FRIDA Enables Transparent Data Availability Sampling with Poly-Logarithmic Proofs
FRIDA uses a novel FRI-based commitment to achieve non-trusted setup data availability sampling, fundamentally improving scalability.
FRI-IOP Establishes Quantum-Resistant Polynomial Commitments for Scalable Proofs
FRI-based polynomial commitments replace pairing-based cryptography with hash-based, quantum-resistant security, enabling transparent, scalable ZK-SNARKs and data availability.
