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: Cramer–Shoup cryptosystem | Statement: [Victor Shoup, coInventorOf, Cramer–Shoup cryptosystem]

Target entity: Cramer–Shoup cryptosystem
Context triple: [Victor Shoup, coInventorOf, Cramer–Shoup 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. Secrecy, Authentication, and Public Key Systems
  "Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
• C. New Directions in Cryptography
  New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
• D. 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.
• 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: Cramer–Shoup cryptosystem
Triple: [Victor Shoup, coInventorOf, 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.

Target entity: Cramer–Shoup cryptosystem
Target entity description: 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.

• 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. Secrecy, Authentication, and Public Key Systems
  "Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
• C. New Directions in Cryptography
  New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
• D. 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.
• 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