Home / Cryptography & Math / Breakthrough Research Establishes Equivalence Between Quantum Key Exchange and Public Quantum Money Schemes

Breakthrough Research Establishes Equivalence Between Quantum Key Exchange and Public Quantum Money Schemes

In a significant theoretical development for the fields of quantum cryptography and information security, a new research paper has mapped out a complete characterization of two-message quantum key exchange, revealing surprising connections to public quantum money and unclonable cryptographic primitives. Authored by Eli Goldin of Princeton University and Tomoyuki Morimae of Kyoto University, the paper titled "Quantum Key Exchange from Public Quantum Money" upends long-held assumptions regarding the foundational requirements needed to secure quantum communications.

For years, cryptographers have understood that achieving statistically secure two-message quantum key exchange, commonly referred to as 2QKE, is fundamentally impossible. Because statistical security is unattainable in this context, the realization of 2QKE inherently requires reliance on computational assumptions. Until recently, the consensus pointed toward one-way functions, or OWFs, as the weakest known foundation for building such protocols. Landmark studies earlier in the decade demonstrated that everlasting-secure 2QKE and quantum public-key encryption equipped with quantum public keys could both be successfully constructed directly from one-way functions.

These past discoveries left an overarching, fundamental question open within the cryptographic community: Could researchers construct two-message quantum key exchange from an assumption even weaker than one-way functions?

Goldin and Morimae’s new work provides a definitive resolution to this inquiry by delivering the first complete characterization of 2QKE. In their manuscript, the researchers demonstrate that four distinct cryptographic primitives are existentially equivalent. This equivalence encompasses standard two-message quantum key exchange, everlasting-secure two-message quantum key exchange, efficiently-verifiable state puzzles—known as EV-StatePuzzs—and one-time secure digital signatures featuring quantum signatures alongside quantum signing keys.

This equivalence carries profound implications for the hierarchy of cryptographic assumptions. Because efficiently-verifiable state puzzles are widely believed by complexity theorists to be potentially weaker than standard one-way functions, the newly established equivalence implies that two-message quantum key exchange may also be achievable under conditions weaker than those previously mandated by OWFs. This shifts the boundaries of what cryptographers must assume to guarantee secure quantum key distribution.

Furthermore, the research establishes a remarkable property regarding the security levels of these protocols. By proving the equivalence between standard 2QKE and everlasting-secure 2QKE, the authors reveal that everlasting security—a gold standard in cryptographic protection where security remains unbroken even against adversaries with unlimited post-protocol computing power—effectively comes for free once basic two-message quantum key exchange is achieved.

The study extends its reach deep into the domain of unclonable cryptographic primitives, which leverage the laws of quantum mechanics to prevent unauthorized duplication of digital objects. The authors show that advanced primitives such as one-shot signatures, quantum lightning, and public-key quantum money mini-schemes all naturally imply the existence of efficiently-verifiable state puzzles. Consequently, the research establishes a novel lower bound, positioning everlasting-secure 2QKE as a fundamental underpinning for these notoriously difficult-to-construct public-key unclonable primitives.

Addressing another prominent open problem in the field, Goldin and Morimae explore the construction of quantum public-key encryption with quantum public keys. While previous work successfully constructed such schemes from one-way functions, it remained an open question whether the primitive could be derived from an assumption that was either strictly weaker than or entirely incomparable to OWFs. By demonstrating that one-shot signatures imply this form of quantum public-key encryption—and noting that one-shot signatures appear to be incomparable with one-way functions—the authors offer a potential pathway to answering this foundational question.

To compound these findings, the quantum public-key encryption schemes derived from one-shot signatures in this framework introduce an innovative additional functionality termed "certified freeze." This feature empowers the receiver to publish a publicly verifiable classical certificate. In turn, this certificate computationally binds the receiver to a strict upper bound concerning the total number of distinct valid ciphertexts that can exist under its specific verification key, adding a new layer of verifiable control to quantum cryptographic architectures.

The research paper, registered as Paper 2026/2786 on the Cryptology ePrint Archive, marks a milestone in theoretical computer science and quantum information security, bridging gaps between quantum money, state puzzles, and key exchange protocols in a unified foundational framework.

Tagged: