Modern Cryptography, Probabilistic Proofs and Pseudorandomness
E127858
"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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Modern Cryptography, Probabilistic Proofs and Pseudorandomness canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1013314 — 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: Modern Cryptography, Probabilistic Proofs and Pseudorandomness Context triple: [Oded Goldreich, authorOf, Modern Cryptography, Probabilistic Proofs and Pseudorandomness]
-
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.
In a World of Pseudorandomness
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
-
C.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
D.
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.
-
E.
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.
- 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: Modern Cryptography, Probabilistic Proofs and Pseudorandomness Target entity description: "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.
-
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.
In a World of Pseudorandomness
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
-
C.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
non-fiction book ⓘ textbook ⓘ |
| aimsTo |
formalize the notion of pseudorandomness
ⓘ
present a unified treatment of probabilistic proof techniques in cryptography ⓘ systematically develop the theory of modern cryptography ⓘ |
| covers |
commitment schemes
ⓘ
complexity classes related to cryptography ⓘ computational hardness assumptions ⓘ digital signatures ⓘ encryption schemes ⓘ indistinguishability-based security ⓘ interactive proofs ⓘ message authentication codes ⓘ private-key encryption ⓘ public-key encryption ⓘ semantic security ⓘ zero-knowledge proofs ⓘ |
| field |
cryptography
ⓘ
theoretical computer science ⓘ |
| focusesOn |
complexity-theoretic security definitions
ⓘ
computational indistinguishability ⓘ hard-core predicates ⓘ one-way functions ⓘ probabilistic method in proofs ⓘ probabilistic proof techniques ⓘ pseudorandom functions ⓘ pseudorandom permutations ⓘ reduction-based security proofs ⓘ theoretical foundations of cryptography ⓘ theory of pseudorandom generators ⓘ |
| genre |
academic literature
ⓘ
mathematics and computer science textbook ⓘ |
| hasFormat |
digital
ⓘ
print ⓘ |
| intendedAudience |
advanced undergraduates in theoretical computer science
ⓘ
graduate students in computer science ⓘ researchers in cryptography ⓘ |
| language | English ⓘ |
| mainSubject |
modern cryptography
ⓘ
probabilistic proofs ⓘ pseudorandomness ⓘ |
| uses |
asymptotic notation
ⓘ
probabilistic algorithms ⓘ rigorous mathematical proofs ⓘ |
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: Modern Cryptography, Probabilistic Proofs and Pseudorandomness Description of subject: "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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.