Quantum Money: Difference between revisions
No edit summary |
|||
| (7 intermediate revisions by 3 users not shown) | |||
| Line 4: | Line 4: | ||
Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [Wie83] in 1983. Informally, the quantum money object is a unique (e.g. has a public classical 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 and types of key encryption used by Mint (see Protocols). | Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [Wie83] in 1983. Informally, the quantum money object is a unique (e.g. has a public classical 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 and types of key encryption used by Mint (see Protocols). | ||
==Use-cases== | |||
* [[Cross-platform finance]] | |||
* [[Toward regulation for security and privacy]] | |||
== Protocols == | == Protocols == | ||
=== Private Key with Quantum Verification === | === Private Key with Quantum Verification === | ||
Mint generates the quantum money and hands it to Holder. Bank shares a secret classical key with Mint for all distributed money. For verification, Merchant sends the quantum money to Bank through a quantum channel. Bank performs local quantum measurements, dictated by the secret classical key, and accepts or rejects the money conditioned on the measurement outcomes. | |||
*[[Wiesner Quantum Money]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]] | *[[Wiesner Quantum Money]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]] | ||
| Line 15: | Line 18: | ||
=== Private Key with Classical Verification === | === Private Key with Classical Verification === | ||
Mint generates the quantum money and hands it to Holder. Bank shares a secret classical 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 hold. | |||
*[[Quantum Coin]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]] | *[[Quantum Coin]]: [[:Category: Quantum Memory Network Stage|Quantum Memory Network Stage]] | ||
| Line 22: | Line 25: | ||
=== Public Key with Quantum Verification === | === Public Key with Quantum Verification === | ||
Mint generates the quantum money and hands it to Holder. All Holder and Merchant parties can verify the authenticity of the money themselves with the help of a public key. | |||
== Properties == | == Properties == | ||
*A QMoney scheme is '''correct''' if an original quantum money issued by Mint is accepted by Bank with unit probability. | |||
*A QMoney scheme is information-theoretically (resp. computationally) '''secure''' if no adversarial holder with unlimited (resp. computational) power can pass verification with different Merchants or Banks at the same time with high probability. | |||
* A QMoney is '''reusable''' if an honest Holder can pass verification with different Merchants or Banks at different times. | |||
==Knowledge Graph== | |||
{{graph}} | |||
== Further Information == | == Further Information == | ||
<div style='text-align: right;'>''*contributed by Mahshid Delavar and Mathieu Bozzio''</div> | <div style='text-align: right;'>''*contributed by Mahshid Delavar and Mathieu Bozzio''</div> | ||
Latest revision as of 13:15, 27 September 2024
Functionality Description[edit]
Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [Wie83] in 1983. Informally, the quantum money object is a unique (e.g. has a public classical 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 and types of key encryption used by Mint (see Protocols).
Use-cases[edit]
Protocols[edit]
Private Key with Quantum Verification[edit]
Mint generates the quantum money and hands it to Holder. Bank shares a secret classical key with Mint for all distributed money. For verification, Merchant sends the quantum money to Bank through a quantum channel. Bank performs local quantum measurements, dictated by the secret classical key, and accepts or rejects the money conditioned on the measurement outcomes.
Private Key with Classical Verification[edit]
Mint generates the quantum money and hands it to Holder. Bank shares a secret classical 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 hold.
Public Key with Quantum Verification[edit]
Mint generates the quantum money and hands it to Holder. All Holder and Merchant parties can verify the authenticity of the money themselves with the help of a public key.
Properties[edit]
- A QMoney scheme is correct if an original quantum money issued by Mint is accepted by Bank with unit probability.
- A QMoney scheme is information-theoretically (resp. computationally) secure if no adversarial holder with unlimited (resp. computational) power can pass verification with different Merchants or Banks at the same time with high probability.
- A QMoney is reusable if an honest Holder can pass verification with different Merchants or Banks at different times.