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.
Efficient Post-Quantum Polynomial Commitments Unlock Scalable Zero-Knowledge Cryptography
Greyhound, a lattice-based polynomial commitment scheme, delivers post-quantum security and vastly smaller proof sizes, enabling practical, future-proof zk-SNARKs.
Quantum Supremacy Consensus Secures Blockchain against Classical Attackers
Proof of Quantum Work (PoQW) leverages quantum supremacy for a consensus primitive that is quantum-safe, low-energy, and classically intractable.
Lattice-Based Folding Achieves Post-Quantum Recursive Succinct Proof Systems
This lattice-based folding scheme enables the first efficient, post-quantum secure recursive SNARKs, securing future scalable blockchain state against quantum threat.
Sublinear Transparent Commitments Unlock Practical Trustless Zero-Knowledge Proofs
A new polynomial commitment scheme achieves sublinear prover complexity and constant proof size, dramatically accelerating zero-knowledge computation and scaling.
Quantum Shares Enable Publicly Verifiable Cryptographic Data Deletion
This new quantum-secure primitive introduces publicly verifiable deletion to secret sharing, neutralizing the threat of long-term data breach by cryptographically destroying shares on demand.
Lattice-Based Folding Achieves Post-Quantum Recursive Zero-Knowledge Proofs
First lattice-based folding scheme secures recursive SNARKs against quantum attack by replacing discrete logarithm commitments with Module SIS.
Quantum Supremacy Secures Energy-Efficient, Quantum-Safe Blockchain Consensus
Proof of Quantum Work leverages quantum supremacy to make mining intractable for classical machines, ensuring quantum-safe security and vastly reducing energy consumption.
Blockchain Designated Verifier Proofs Ensure Non-Transferable Privacy on Public Ledgers
The Blockchain Designated Verifier Proof (BDVP) uses a verifier-held trapdoor to simulate fake proofs, restoring non-transferable privacy to ZKPs on public chains.
