Post-quantum cryptographic migration requires succinct proof systems resistant to quantum polynomial-time adversaries. We propose a designated-verifier zk-SNARK construction based strictly on the hardness of the Module Learning With Errors (M-LWE) and Module Short Integer Solution (M-SIS) problems. Our protocol reduces proof size by 43% relative to previous lattice-based arguments.
The full manuscript includes introduction, methodology, results, discussion, conclusion, figures, tables, and complete bibliography with all 1 references.
↓ Download Full PDF (145-172)