Quantum Copy-Protection and Quantum Money
E1002079
"Quantum Copy-Protection and Quantum Money" is a seminal research paper by Scott Aaronson that explores how quantum information can be used to create unforgeable money and software that cannot be copied.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Quantum Copy-Protection and Quantum Money canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T12797752 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Quantum Copy-Protection and Quantum Money Context triple: [Scott Aaronson, notableWork, Quantum Copy-Protection and Quantum Money]
-
A.
Quantum cryptography: Public key distribution and coin tossing
"Quantum cryptography: Public key distribution and coin tossing" is a pioneering research paper that introduced the use of quantum mechanics for secure key distribution and cryptographic protocols such as coin tossing, laying foundational concepts for the field of quantum cryptography.
-
B.
BB84 quantum key distribution protocol
The BB84 quantum key distribution protocol is a pioneering cryptographic scheme that uses quantum properties of photons to enable two parties to establish a shared secret key with security guaranteed by the laws of quantum mechanics.
-
C.
Bennett–Brassard 1984 protocol
The Bennett–Brassard 1984 protocol is the first quantum key distribution scheme, using quantum properties of photons to enable two parties to establish a shared secret key with security guaranteed by the laws of quantum mechanics.
-
D.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
E.
Yao’s garbled circuits
Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Quantum Copy-Protection and Quantum Money Target entity description: "Quantum Copy-Protection and Quantum Money" is a seminal research paper by Scott Aaronson that explores how quantum information can be used to create unforgeable money and software that cannot be copied.
-
A.
Quantum cryptography: Public key distribution and coin tossing
"Quantum cryptography: Public key distribution and coin tossing" is a pioneering research paper that introduced the use of quantum mechanics for secure key distribution and cryptographic protocols such as coin tossing, laying foundational concepts for the field of quantum cryptography.
-
B.
BB84 quantum key distribution protocol
The BB84 quantum key distribution protocol is a pioneering cryptographic scheme that uses quantum properties of photons to enable two parties to establish a shared secret key with security guaranteed by the laws of quantum mechanics.
-
C.
Bennett–Brassard 1984 protocol
The Bennett–Brassard 1984 protocol is the first quantum key distribution scheme, using quantum properties of photons to enable two parties to establish a shared secret key with security guaranteed by the laws of quantum mechanics.
-
D.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
E.
Yao’s garbled circuits
Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
research paper
ⓘ
scientific publication ⓘ |
| addressesProblem |
copying of digital money
ⓘ
forgery resistance in digital currencies ⓘ piracy of software ⓘ |
| author | Scott Aaronson NERFINISHED ⓘ |
| authorAffiliation | Scott Aaronson – MIT (at time of much of his early quantum complexity work) NERFINISHED ⓘ |
| category | quantum cryptography literature ⓘ |
| citedFor |
connection between no-cloning and unforgeability
ⓘ
early formalization of quantum money ⓘ introduction of quantum copy-protection as a cryptographic task ⓘ |
| contribution |
formalizes notions of quantum copy-protection
ⓘ
formalizes notions of quantum money ⓘ shows how quantum information can limit copying ⓘ |
| demonstrates | advantages of quantum information over classical information for copy-protection ⓘ |
| discusses |
limitations of classical copy-protection
ⓘ
security definitions for quantum copy-protection ⓘ security definitions for quantum money ⓘ |
| field |
quantum computing
ⓘ
quantum information theory ⓘ theoretical computer science ⓘ |
| focusesOn |
using quantum information to construct unforgeable money
ⓘ
using quantum information to prevent copying of software ⓘ |
| goal |
construct money that is easy to verify but hard to forge
ⓘ
construct software that can be used but not duplicated ⓘ |
| hasImpactOn |
post-classical cryptography
ⓘ
research on quantum money schemes ⓘ research on quantum software protection ⓘ |
| hasVersion | e-print on arXiv ⓘ |
| influencedBy |
classical copy-protection research
ⓘ
public-key cryptography ⓘ quantum cryptography NERFINISHED ⓘ |
| language | English ⓘ |
| mainTopic |
cryptography
ⓘ
no-cloning theorem NERFINISHED ⓘ quantum copy-protection ⓘ quantum money ⓘ unforgeable quantum states ⓘ |
| proposes |
schemes for quantum copy-protection
ⓘ
schemes for quantum money ⓘ |
| relatedTo |
complexity theory
ⓘ
computational hardness assumptions ⓘ quantum states as proofs of authenticity ⓘ |
| typeOfWork | theoretical research ⓘ |
| usesConcept |
quantum no-cloning principle
ⓘ
quantum states as cryptographic tokens ⓘ |
| usesModel |
oracle-based constructions
ⓘ
quantum circuits ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Quantum Copy-Protection and Quantum Money Description of subject: "Quantum Copy-Protection and Quantum Money" is a seminal research paper by Scott Aaronson that explores how quantum information can be used to create unforgeable money and software that cannot be copied.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.