“Theory and applications of trapdoor functions”
E926128
“Theory and applications of trapdoor functions” is a foundational cryptography paper by Andrew Yao that formalizes trapdoor functions and demonstrates their use in constructing secure cryptographic protocols.
All labels observed (1)
| Label | Occurrences |
|---|---|
| “Theory and applications of trapdoor functions” canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11438097 — 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: “Theory and applications of trapdoor functions” Context triple: [Andrew Yao, notableWork, “Theory and applications of trapdoor functions”]
-
A.
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.
-
B.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
C.
Naor–Yung encryption paradigm
The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
-
D.
Naor–Reingold pseudorandom function
The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
-
E.
Merkle–Hellman knapsack cryptosystem
The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
- 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: “Theory and applications of trapdoor functions” Target entity description: “Theory and applications of trapdoor functions” is a foundational cryptography paper by Andrew Yao that formalizes trapdoor functions and demonstrates their use in constructing secure cryptographic protocols.
-
A.
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.
-
B.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
C.
Naor–Yung encryption paradigm
The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
-
D.
Naor–Reingold pseudorandom function
The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
-
E.
Merkle–Hellman knapsack cryptosystem
The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
- F. None of above. chosen
Statements (36)
| Predicate | Object |
|---|---|
| instanceOf |
cryptography paper
ⓘ
scientific paper ⓘ |
| author | Andrew Chi-Chih Yao NERFINISHED ⓘ |
| contribution |
complexity-theoretic treatment of trapdoor functions
ⓘ
formal framework for trapdoor functions ⓘ link between trapdoor functions and public-key cryptosystems ⓘ methods to construct digital signature schemes ⓘ methods to construct secure encryption schemes ⓘ |
| describes |
difficulty of inversion without trapdoor
ⓘ
how to invert trapdoor functions with secret information ⓘ |
| field |
cryptography
ⓘ
theoretical computer science ⓘ |
| focusesOn |
construction of secure cryptographic protocols
ⓘ
formalization of trapdoor functions ⓘ security definitions for trapdoor functions ⓘ |
| hasInfluenceOn |
complexity-based cryptography
ⓘ
cryptographic security reductions ⓘ design of cryptographic protocols ⓘ modern public-key cryptography ⓘ |
| language | English ⓘ |
| mainTopic |
cryptographic protocol
ⓘ
one-way function ⓘ public-key cryptography ⓘ trapdoor function ⓘ |
| notableFor | foundational treatment of trapdoor functions in cryptography ⓘ |
| proposes |
applications of trapdoor functions to authentication
ⓘ
applications of trapdoor functions to encryption ⓘ formal properties required of trapdoor functions ⓘ |
| relatedTo |
complexity theory
ⓘ
digital signatures ⓘ public-key encryption ⓘ zero-knowledge proofs ⓘ |
| usesConcept |
computational hardness assumption
ⓘ
one-wayness ⓘ polynomial-time computation ⓘ trapdoor information ⓘ |
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: “Theory and applications of trapdoor functions” Description of subject: “Theory and applications of trapdoor functions” is a foundational cryptography paper by Andrew Yao that formalizes trapdoor functions and demonstrates their use in constructing secure cryptographic protocols.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.