Triple
T18276404
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ivan Damgård |
E437746
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Damgård–Jurik cryptosystem |
—
|
NE NERFINISHED |
How this triple was built (3 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Damgård–Jurik cryptosystem | Statement: [Ivan Damgård, knownFor, Damgård–Jurik cryptosystem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Damgård–Jurik cryptosystem Context triple: [Ivan Damgård, knownFor, Damgård–Jurik cryptosystem]
-
A.
Cramer–Shoup cryptosystem
The Cramer–Shoup cryptosystem is a public-key encryption scheme designed to be secure against adaptive chosen-ciphertext attacks, improving on earlier systems like ElGamal in terms of robustness and security guarantees.
-
B.
Rabin cryptosystem
The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
-
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.
Schnorr signature scheme
The Schnorr signature scheme is a digital signature algorithm known for its simplicity, strong security proofs under the discrete logarithm assumption, and efficiency, forming the basis for several modern signature schemes.
- 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: Damgård–Jurik cryptosystem Target entity description: The Damgård–Jurik cryptosystem is a public-key encryption scheme that generalizes the Paillier cryptosystem to support larger message spaces and flexible homomorphic properties.
-
A.
Cramer–Shoup cryptosystem
The Cramer–Shoup cryptosystem is a public-key encryption scheme designed to be secure against adaptive chosen-ciphertext attacks, improving on earlier systems like ElGamal in terms of robustness and security guarantees.
-
B.
Rabin cryptosystem
The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
-
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.
Schnorr signature scheme
The Schnorr signature scheme is a digital signature algorithm known for its simplicity, strong security proofs under the discrete logarithm assumption, and efficiency, forming the basis for several modern signature schemes.
- F. None of above. chosen
Provenance (2 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69d8b914530c8190b4474d862a2b2a1b |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e500528bb88190a9f9ba6428cc2076 |
completed | April 19, 2026, 4:18 p.m. |
Created at: April 10, 2026, 10:34 a.m.