Quantum-Secure Zero-Knowledge Proofs via Extractable Homomorphic Commitments
A novel extractable homomorphic commitment primitive enables efficient lattice-based non-interactive zero-knowledge proofs provably secure against quantum adversaries.
Post-Quantum zk-SNARKs from LWE Secure Verifiable Computation for All Circuits
This research formalizes quantum-safe zk-SNARKs for arithmetic circuits using LWE, securing blockchain's verifiable computation layer.
Post-Quantum Succinct Arguments Secure Verifiable Computation against Quantum Adversaries
This work proves a foundational succinct argument is secure in the Quantum Random Oracle Model, guaranteeing long-term security for verifiable computation.
