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: Goldwasser–Micali cryptosystem | Statement: [Blum integer, usedIn, Goldwasser–Micali cryptosystem]

Target entity: Goldwasser–Micali cryptosystem
Context triple: [Blum integer, usedIn, Goldwasser–Micali cryptosystem]

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

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Goldwasser–Micali cryptosystem
Triple: [Blum integer, usedIn, 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.

Target entity: Goldwasser–Micali cryptosystem
Target entity description: 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.

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