Quantum Money: Difference between revisions

From Quantum Protocol Zoo
Jump to navigation Jump to search
No edit summary
Line 19: Line 19:


*[[Quantum Coin]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]]
*[[Quantum Coin]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]]
*[[Quantum Token]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]]
*[[Unforgeable Quantum Token]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]]


=== Public Key with Quantum Verification ===
=== Public Key with Quantum Verification ===

Revision as of 11:03, 25 April 2019

Functionality Description

Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [Wie83] in 1983. Informally, a quantum money is a unique (e.g. has a serial number) and unforgeable (e.g. unclonable) physical object that is created by a third party called Mint (that could be trusted or not trusted). Then, it is circulated among potentially untrusted parties, Holder, who might attempt to forge it for double spending. However a Merchant, upon receiving it, should be able to verify the money has not been forged and originated from Mint. There are various verification schemes based on different types of communication they use and type of key encryption used by Mint see Protocols.

Protocols

Private Key with Quantum Verification

It involves a trusted party called Bank, who shares secrete key with Mint for all distributed money. For verification, Merchant sends quantum money to Bank through a quantum channel. Bank performs local quantum operations depending on the secret key they hold to reject or accept the money.


Private Key with Classical Verification

It involves a trusted party called Bank, who shares secrete key with Mint for all distributed money. For verification, Merchant performs local quantum operations on the money and sends classical data to Bank who accepts or rejects based on the secret key they holds.

Public Key with Quantum Verification

Public Key with Classical Verification

Properties

reusable correctness Transferability Unforgeability verifiability Security Authenticity

*contributed by Mashid Delavar