Eyal Kushilevitz
E414312
Eyal Kushilevitz is an Israeli computer scientist known for his influential work in cryptography, communication complexity, and theoretical computer science.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Eyal Kushilevitz canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T4087566 — 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: Eyal Kushilevitz Context triple: [Rafail Ostrovsky, notableStudent, Eyal Kushilevitz]
-
A.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
B.
Moni Naor
Moni Naor is an Israeli computer scientist renowned for his foundational contributions to cryptography and theoretical computer science.
-
C.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
D.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
E.
Boaz Barak
Boaz Barak is a prominent theoretical computer scientist known for his influential work in cryptography and computational complexity theory.
- 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: Eyal Kushilevitz Target entity description: Eyal Kushilevitz is an Israeli computer scientist known for his influential work in cryptography, communication complexity, and theoretical computer science.
-
A.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
B.
Moni Naor
Moni Naor is an Israeli computer scientist renowned for his foundational contributions to cryptography and theoretical computer science.
-
C.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
D.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
E.
Boaz Barak
Boaz Barak is a prominent theoretical computer scientist known for his influential work in cryptography and computational complexity theory.
- F. None of above. chosen
Statements (38)
| Predicate | Object |
|---|---|
| instanceOf |
Israeli person
ⓘ
academic ⓘ computer scientist ⓘ |
| academicDiscipline | complexity theory ⓘ |
| affiliation | Technion – Israel Institute of Technology ⓘ |
| almaMater | Hebrew University of Jerusalem ⓘ |
| authorOf |
Communication Complexity (book)
ⓘ
research papers in communication complexity ⓘ research papers in cryptography ⓘ research papers in theoretical computer science ⓘ |
| citizenship | Israel ⓘ |
| coAuthor | Noam Nisan ⓘ |
| educatedIn | computer science ⓘ |
| employer | Technion – Israel Institute of Technology ⓘ |
| field |
communication complexity
ⓘ
computer science ⓘ cryptography ⓘ theoretical computer science ⓘ |
| hasAcademicAdvisor |
Michael Rabin
ⓘ
surface form:
Michael O. Rabin
|
| knownFor |
research on circuit complexity
ⓘ
research on private information retrieval ⓘ research on secure multiparty computation ⓘ work in communication complexity ⓘ work in cryptography ⓘ work in theoretical computer science ⓘ |
| language |
English
ⓘ
Hebrew ⓘ |
| memberOf |
Faculty of Computer Science at Technion
ⓘ
surface form:
Technion Faculty of Computer Science
|
| nationality | Israeli ⓘ |
| notableContribution |
contributions to secure computation protocols
ⓘ
foundational results in private information retrieval ⓘ results on lower bounds in communication complexity ⓘ |
| position |
faculty member at Technion
ⓘ
professor ⓘ |
| researchArea |
cryptographic protocols
ⓘ
private information retrieval ⓘ secure multiparty computation ⓘ |
| workplace |
Faculty of Computer Science at Technion
ⓘ
surface form:
Computer Science Department, Technion
|
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: Eyal Kushilevitz Description of subject: Eyal Kushilevitz is an Israeli computer scientist known for his influential work in cryptography, communication complexity, and theoretical computer science.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.