Triple

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).

Phrase: Damgård–Nielsen multiparty computation protocols | Statement: [Ivan Damgård, knownFor, Damgård–Nielsen multiparty computation protocols]

Target entity: Damgård–Nielsen multiparty computation protocols
Context triple: [Ivan Damgård, knownFor, Damgård–Nielsen multiparty computation protocols]

• A. 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.
• B. Universal Composability framework
  The Universal Composability framework is a foundational cryptographic security model that enables protocols to remain secure even when composed with arbitrary other protocols running concurrently.
• C. How to Exchange Secrets by Oblivious Transfer
  "How to Exchange Secrets by Oblivious Transfer" is a seminal cryptography paper by Michael O. Rabin that introduced the concept of oblivious transfer, a fundamental primitive for secure multi-party computation and privacy-preserving protocols.
• D. Modern Cryptography, Probabilistic Proofs and Pseudorandomness
  "Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
• E. 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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Damgård–Nielsen multiparty computation protocols
Target entity description: Damgård–Nielsen multiparty computation protocols are a family of cryptographic protocols that enable multiple parties to jointly compute a function over their private inputs while preserving security and privacy even in the presence of malicious adversaries.

• A. 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.
• B. Universal Composability framework
  The Universal Composability framework is a foundational cryptographic security model that enables protocols to remain secure even when composed with arbitrary other protocols running concurrently.
• C. How to Exchange Secrets by Oblivious Transfer
  "How to Exchange Secrets by Oblivious Transfer" is a seminal cryptography paper by Michael O. Rabin that introduced the concept of oblivious transfer, a fundamental primitive for secure multi-party computation and privacy-preserving protocols.
• D. Modern Cryptography, Probabilistic Proofs and Pseudorandomness
  "Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
• E. 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.
• F. None of above. chosen