Triple

T18281321
Position Surface form Disambiguated ID Type / Status
Subject SIV misuse-resistant AEAD E437869 entity
Predicate introducedInPublication P309 FINISHED
Object Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem — NE NERFINISHED

How this triple was built (2 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: Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem | Statement: [SIV misuse-resistant AEAD, introducedInPublication, Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem
Context triple: [SIV misuse-resistant AEAD, introducedInPublication, Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem]
  • A. 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.
  • B. SIV misuse-resistant AEAD chosen
    SIV misuse-resistant AEAD is a cryptographic scheme designed to provide authenticated encryption that remains secure even when nonces are misused or repeated.
  • C. Carter–Wegman MACs
    Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
  • D. Probabilistic Encryption
    Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
  • E. Recommendation for Block Cipher Modes of Operation: Methods and Techniques
    "Recommendation for Block Cipher Modes of Operation: Methods and Techniques" is a NIST Special Publication that defines and standardizes approved modes of operation for block cipher algorithms used in cryptographic applications.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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_69e50056ea0481908d66bf263ac80c75 completed April 19, 2026, 4:18 p.m.
Created at: April 10, 2026, 10:35 a.m.