Semi-quantum Money

Roy Radian, Or Sattath

Research output: Contribution to journalArticlepeer-review

Abstract

Quantum money allows a bank to mint quantum money states that can later be verified and cannot be forged. Usually, this requires a quantum communication infrastructure to perform transactions. Gavinsky (CCC 2012) introduced the notion of classically verifiable quantum money, which allows verification through classical communication. In this work, we introduce the notion of classical minting and combine it with classical verification to introduce semi-quantum money. Semi-quantum money is the first type of quantum money to allow transactions with completely classical communication and an entirely classical bank. This work features constructions for both a public memory-dependent semi-quantum money scheme and a private memoryless semi-quantum money scheme. The public construction is based on the works of Zhandry and Coladangelo, and the private construction is based on the notion of noisy trapdoor claw-free functions (NTCF) introduced by Brakerski et al. (FOCS 2018). In terms of technique, our main contribution is a perfect parallel repetition theorem for NTCF.

Original languageAmerican English
Article number8
JournalJournal of Cryptology
Volume35
Issue number2
DOIs
StatePublished - 1 Apr 2022

Keywords

  • Quantum Cryptography
  • Quantum Money
  • Semi-quantum Money
  • Trapdoor Claw-Free Functions

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Semi-quantum Money'. Together they form a unique fingerprint.

Cite this