Write, autoreview, editor, reviewer
3,129
edits
Quantum Money: Difference between revisions
Jump to navigation
Jump to search
no edit summary
No edit summary |
No edit summary |
||
| 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 == | ||
| Line 31: | Line 34: | ||
* A QMoney is '''reusable''' if an honest Holder can pass verification with different Merchants or Banks at different times. | * A QMoney is '''reusable''' if an honest Holder can pass verification with different Merchants or Banks at different times. | ||
==Knowledge Graph== | ==Knowledge Graph== | ||