Naor–Yung encryption paradigm
E831745
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Naor–Yung encryption paradigm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9958183 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Naor–Yung encryption paradigm Context triple: [Moni Naor, notableWork, Naor–Yung encryption paradigm]
-
A.
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.
-
B.
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.
-
C.
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.
-
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.
Merkle–Hellman knapsack cryptosystem
The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Naor–Yung encryption paradigm Target entity description: 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.
-
A.
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.
-
B.
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.
-
C.
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.
-
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.
Merkle–Hellman knapsack cryptosystem
The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic paradigm
ⓘ
public-key encryption construction ⓘ |
| aimsToPrevent |
ciphertext malleability
ⓘ
decryption oracle abuse in CCA attacks ⓘ |
| appliesTo | public-key encryption schemes ⓘ |
| assumes |
existence of semantically secure public-key encryption
ⓘ
existence of zero-knowledge proofs for NP ⓘ |
| category | encryption paradigm ⓘ |
| ciphertextStructure | pair of ciphertexts plus proof ⓘ |
| constructionStep |
attach a zero-knowledge proof that the two ciphertexts encrypt the same plaintext
ⓘ
encrypt the same plaintext under the public key twice independently ⓘ |
| decryptionCondition | decrypt only if the proof verifies ⓘ |
| ensures |
integrity of ciphertexts under CCA
ⓘ
non-malleability under chosen-ciphertext attack ⓘ |
| field |
cryptography
ⓘ
public-key cryptography ⓘ |
| goal |
CCA security
ⓘ
chosen-ciphertext security ⓘ |
| hasAuthors |
Moni Naor
NERFINISHED
ⓘ
Moti Yung NERFINISHED ⓘ |
| influenced |
CCA-secure encryption scheme design
ⓘ
cryptographic protocol design ⓘ |
| inputProperty |
IND-CPA security
ⓘ
semantic security ⓘ |
| introducedInContextOf | public-key cryptosystems secure against chosen-ciphertext attacks ⓘ |
| namedAfter |
Moni Naor
NERFINISHED
ⓘ
Moti Yung NERFINISHED ⓘ |
| outputProperty |
IND-CCA security
ⓘ
security against chosen-ciphertext attacks ⓘ |
| property |
black-box use of underlying encryption scheme
ⓘ
generic transformation from IND-CPA to IND-CCA ⓘ |
| relatedConcept |
Cramer–Shoup cryptosystem
NERFINISHED
ⓘ
Fujisaki–Okamoto transform NERFINISHED ⓘ non-malleable encryption ⓘ zero-knowledge proof systems ⓘ |
| reliesOn |
semantic security of the underlying encryption scheme
ⓘ
soundness of zero-knowledge proofs ⓘ zero-knowledge proof of equality of plaintexts ⓘ |
| securityModel |
IND-CCA2
ⓘ
adaptive chosen-ciphertext attack ⓘ |
| typicalProofTool |
hybrid argument
GENERATED
ⓘ
simulation of zero-knowledge proofs GENERATED ⓘ |
| usesTechnique |
double encryption
ⓘ
zero-knowledge proofs ⓘ |
| verificationStep | check validity of the zero-knowledge proof ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Naor–Yung encryption paradigm Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.