Oded Goldreich
E21871
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Oded Goldreich canonical | 14 |
How this entity was disambiguated
This entity first appeared as the object of triple T143817 — 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: Oded Goldreich Context triple: [Shafi Goldwasser, coAuthor, Oded Goldreich]
-
A.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
-
D.
Ronald L. Rivest
Ronald L. Rivest is an American cryptographer and computer scientist best known as one of the co-inventors of the RSA public-key cryptosystem and a pioneer in modern cryptography.
-
E.
Ralph Merkle
Ralph Merkle is an American computer scientist and cryptographer known as a pioneer of public-key cryptography and for contributions such as Merkle trees and Merkle–Damgård hashing.
- 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: Oded Goldreich Target entity description: Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
A.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
-
D.
Ronald L. Rivest
Ronald L. Rivest is an American cryptographer and computer scientist best known as one of the co-inventors of the RSA public-key cryptosystem and a pioneer in modern cryptography.
-
E.
Ralph Merkle
Ralph Merkle is an American computer scientist and cryptographer known as a pioneer of public-key cryptography and for contributions such as Merkle trees and Merkle–Damgård hashing.
- F. None of above. chosen
Statements (54)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
cryptographer ⓘ human ⓘ theoretical computer scientist ⓘ |
| authorOf |
Computational Complexity: A Conceptual Perspective
ⓘ
foundations of cryptography ⓘ
surface form:
Foundations of Cryptography, Volume 1: Basic Tools
foundations of cryptography ⓘ
surface form:
Foundations of Cryptography, Volume 2: Basic Applications
In a World of Pseudorandomness ⓘ Introduction to Property Testing ⓘ Modern Cryptography, Probabilistic Proofs and Pseudorandomness ⓘ P, NP, and NP-Completeness: The Basics of Complexity Theory ⓘ |
| awardReceived |
EATCS Award
ⓘ
Gödel Prize ⓘ RSA Award for Excellence in Mathematics ⓘ |
| countryOfCitizenship | Israel ⓘ |
| doctoralAdvisor | Shimon Even ⓘ |
| educatedAt |
Tel Aviv University
ⓘ
Weizmann Institute of Science ⓘ |
| employer | Weizmann Institute of Science ⓘ |
| fieldOfWork |
computational complexity theory
ⓘ
computational learning theory ⓘ computer science ⓘ cryptography ⓘ derandomization ⓘ probabilistically checkable proofs ⓘ property testing ⓘ pseudorandomness ⓘ |
| gender | male ⓘ |
| hasAcademicRank | professor ⓘ |
| hasResearchInterest |
average-case complexity
ⓘ
hardness amplification ⓘ interactive proofs ⓘ locally decodable codes ⓘ locally testable codes ⓘ one-way functions ⓘ pseudorandom functions ⓘ pseudorandom generators ⓘ secure multiparty computation ⓘ zero-knowledge proofs ⓘ |
| knownFor |
foundations of cryptography
ⓘ
surface form:
complexity-theoretic foundations of cryptography
foundations of cryptography ⓘ hardness of approximation ⓘ probabilistically checkable proofs ⓘ property testing ⓘ theory of pseudorandomness ⓘ |
| memberOf |
Academia Europaea
ⓘ
Israel Academy of Sciences and Humanities ⓘ |
| nativeLanguage | Hebrew ⓘ |
| notableStudent |
Boaz Barak
ⓘ
Guy Rothblum ⓘ Iftach Haitner ⓘ Omer Reingold ⓘ |
| workLocation |
Israel
ⓘ
Rehovot ⓘ |
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: Oded Goldreich Description of subject: Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
Referenced by (14)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Foundations of Cryptography
subject surface form:
Foundations of Cryptography, Volume 1: Basic Tools
subject surface form:
Foundations of Cryptography, Volume 2: Basic Applications