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: Ajtai–Dwork cryptosystem | Statement: [Miklós Ajtai, notableWork, Ajtai–Dwork cryptosystem]

Target entity: Ajtai–Dwork cryptosystem
Context triple: [Miklós Ajtai, notableWork, Ajtai–Dwork cryptosystem]

• A. Goldwasser–Micali cryptosystem
  The Goldwasser–Micali cryptosystem is a pioneering probabilistic public-key encryption scheme that provides semantic security by encrypting each bit of a message using quadratic residuosity assumptions.
• B. 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.
• C. 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.
• D. Massey–Omura cryptosystem
  The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
• E. Damgård–Jurik cryptosystem
  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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Ajtai–Dwork cryptosystem
Target entity description: The Ajtai–Dwork cryptosystem is an early public-key encryption scheme based on lattice problems, notable for pioneering worst-case to average-case security reductions in cryptography.

• A. Goldwasser–Micali cryptosystem
  The Goldwasser–Micali cryptosystem is a pioneering probabilistic public-key encryption scheme that provides semantic security by encrypting each bit of a message using quadratic residuosity assumptions.
• B. 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.
• C. 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.
• D. Massey–Omura cryptosystem
  The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
• E. Damgård–Jurik cryptosystem
  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.
• F. None of above. chosen