Probabilistic Encryption
E17287
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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| ElGamal encryption | 1 |
| Probabilistic Encryption canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T143821 — 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: Probabilistic Encryption Context triple: [Shafi Goldwasser, notableWork, Probabilistic Encryption]
-
A.
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.
-
B.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
C.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
D.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
E.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
- 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: Probabilistic Encryption Target entity description: 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.
-
A.
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.
-
B.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
C.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
D.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
E.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic technique
ⓘ
encryption scheme ⓘ |
| aimsTo | enhance security ⓘ |
| canAchieve | IND-CPA security ⓘ |
| canBeBuiltFrom |
one-way functions with hard-core predicates
ⓘ
trapdoor permutations ⓘ |
| contrastsWith | deterministic encryption ⓘ |
| enables | indistinguishability of ciphertexts ⓘ |
| goal | make ciphertexts reveal no partial information about plaintext ⓘ |
| hasAdvantage |
hides equality of plaintexts
ⓘ
prevents dictionary attacks based on deterministic ciphertexts ⓘ |
| hasConstraint | randomness must be unpredictable to attackers ⓘ |
| hasProperty |
non-deterministic encryption
ⓘ
same key and message can yield many possible ciphertexts ⓘ same plaintext can yield different ciphertexts ⓘ |
| hasSecurityNotion | IND-CPA ⓘ |
| implies | ciphertexts are not uniquely determined by plaintext ⓘ |
| improves | semantic security ⓘ |
| isBasedOn | probability theory ⓘ |
| isComponentOf | many standardized encryption schemes ⓘ |
| isDefinedIn | modern cryptography ⓘ |
| isGeneralizationOf | randomized padding in RSA-OAEP ⓘ |
| isRelatedTo |
indistinguishability under chosen-plaintext attack
ⓘ
probabilistic public-key encryption ⓘ randomized encryption ⓘ semantic security ⓘ |
| isUsedFor |
encrypting sensitive data
ⓘ
public-key based key encapsulation ⓘ secure communication ⓘ |
| isUsedIn |
CCA-secure public-key schemes
ⓘ
ElGamal encryption ⓘ
linked to:
Probabilistic Encryption
RSA-OAEP ⓘ
linked to:
PKCS #1
hybrid encryption schemes ⓘ public-key encryption schemes ⓘ symmetric-key encryption schemes ⓘ |
| mayUse |
random initialization vectors
ⓘ
random nonces ⓘ random padding ⓘ |
| protectsAgainst |
chosen-plaintext attacks
ⓘ
ciphertext-only attacks ⓘ |
| requires |
decryption algorithm that ignores randomness
ⓘ
high-quality randomness source ⓘ random bits during encryption ⓘ |
| uses | randomness ⓘ |
| wasFormalizedBy |
Shafi Goldwasser
ⓘ
Silvio Micali ⓘ |
| wasFormalizedIn | 1980s ⓘ |
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: Probabilistic Encryption Description of subject: 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.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Probabilistic Encryption