2022/07/26 by Andrey Boris Khesin, Khesin, Andrey Boris, Jonathan Z. Lu +3 · 1 voice
Computer Science · Mathematics · #Analytic Number Theory Research #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #cs.CR #quant-ph
paper · pdf · doi:10.48550/arxiv.2207.13135
openalex publication_date 2022/07/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Publicly verifiable quantum money is a protocol for the preparation of quantum states that can be efficiently verified by any party for authenticity but is computationally infeasible to counterfeit. We develop a cryptographic scheme for publicly verifiable quantum money based on Gaussian superpositions over random lattices. We introduce a verification-of-authenticity procedure based on the lattice discrete Fourier transform, and subsequently prove the unforgeability of our quantum money under the hardness of the short vector problem from lattice-based cryptography.