Revision History for: Quantum Money
- 2026-06-07 at 19:02 by Mina Doosti
Functionality Description
Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [1] 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 acheck).
Protocols
The protocols that implement this functionality are:
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Cross-platform finance. acheck
- Toward regulation for security and privacy. acheck
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.
Further Information
No content has been added to this section, yet!
References
* The original version of this page on the old QPZoo was created by Mahshid Delavar and Mathieu Bozzio
- Wiesner, Stephen. “Conjugate coding.” ACM Sigact News 15, no. 1 (1983): 78-88.
- 2025-06-24 at 21:29 by JuliaM
Functionality Description
Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [1] 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 acheck).
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Cross-platform finance. acheck
- Toward regulation for security and privacy. acheck
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.
Further Information
No content has been added to this section, yet!
References
- Wiesner, Stephen. “Conjugate coding.” ACM Sigact News 15, no. 1 (1983): 78-88.
- 2025-05-16 at 09:29 by JuliaM
Functionality Description
Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [1] 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 acheck).
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Cross-platform finance. acheck
- Toward regulation for security and privacy. acheck
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.
Further Information
No content has been added to this section, yet!
References
- Wiesner, Stephen. “Conjugate coding.” ACM Sigact News 15, no. 1 (1983): 78-88.
- 2025-05-15 at 13:40 by JuliaM
Functionality Description
Quantum Money is a quantum cryptographic scheme that was first introduced by Wiesner [] 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 acheck).
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Cross-platform finance. acheck
- Toward regulation for security and privacy. acheck
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.
Further Information
No content has been added to this section, yet!
References
- Wiesner, Stephen. “Conjugate coding.” ACM Sigact News 15, no. 1 (1983): 78-88.