Anonymous Quantum Tokens with Classical Verification
By: Dmytro Gavinsky , Dar Gilboa , Siddhartha Jain and more
Potential Business Impact:
Makes money impossible to copy or fake.
The no-cloning theorem can be used as a basis for quantum money constructions which guarantee unconditionally unforgeable currency. Existing schemes, however, either (i) require long-term quantum memory and quantum communication between the user and the bank in order to verify the validity of a bill or (ii) fail to protect user privacy due to the uniqueness of each bill issued by the bank, which can allow its usage to be tracked. We introduce a construction of single-use quantum money that gives users the ability to detect whether the issuing authority is tracking them, employing an auditing procedure for which we prove unconditional security. Bill validation is classical, and hence does not require long-term quantum memory or quantum communication, making the protocol relatively practical to deploy. We discuss potential applications beyond money, including anonymous one-time pads and voting.
Similar Papers
Multi-Copy Security in Unclonable Cryptography
Quantum Physics
Protects digital secrets from being copied.
Cryptography without Long-Term Quantum Memory and Global Entanglement: Classical Setups for One-Time Programs, Copy Protection, and Stateful Obfuscation
Quantum Physics
Makes secret computer programs uncopyable and secure.
Unclonable Cryptography in Linear Quantum Memory
Quantum Physics
Makes secret codes harder to steal and copy.