Daniele Micciancio
E163655
Daniele Micciancio is a computer scientist known for his influential work in lattice-based cryptography and computational complexity.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Daniele Micciancio canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T1413475 — 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: Daniele Micciancio Context triple: [Ueli Maurer, notableStudent, Daniele Micciancio]
-
A.
Mihir Bellare
Mihir Bellare is a prominent computer scientist and cryptographer known for his foundational work in modern cryptographic theory and practice.
-
B.
Phillip Rogaway
Phillip Rogaway is a prominent cryptographer known for his influential work on the theory and practice of encryption and for advocating the ethical and social responsibilities of 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.
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.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
- 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: Daniele Micciancio Target entity description: Daniele Micciancio is a computer scientist known for his influential work in lattice-based cryptography and computational complexity.
-
A.
Mihir Bellare
Mihir Bellare is a prominent computer scientist and cryptographer known for his foundational work in modern cryptographic theory and practice.
-
B.
Phillip Rogaway
Phillip Rogaway is a prominent cryptographer known for his influential work on the theory and practice of encryption and for advocating the ethical and social responsibilities of 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.
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.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
- F. None of above. chosen
Statements (40)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
person ⓘ |
| countryOfCitizenship | Italy ⓘ |
| doctoralAdvisor | Shafi Goldwasser ⓘ |
| educatedAt |
Massachusetts Institute of Technology
ⓘ
Sapienza University of Rome ⓘ |
| employer | University of California, San Diego ⓘ |
| fieldOfWork |
computational complexity theory
ⓘ
computer science ⓘ cryptography ⓘ lattice-based cryptography ⓘ theoretical computer science ⓘ |
| hasAcademicRank | full professor ⓘ |
| hasRole |
journal editorial board member
ⓘ
program committee chair ⓘ program committee member ⓘ |
| knownFor |
complexity of lattice problems
ⓘ
cryptographic constructions from worst-case lattice assumptions ⓘ hardness of lattice problems ⓘ lattice-based cryptography ⓘ learning with errors (LWE) related work ⓘ short integer solution (SIS) problem ⓘ |
| languageSpoken |
English
ⓘ
Italian ⓘ |
| memberOf |
Association for Computing Machinery
ⓘ
IEEE ⓘ |
| notableWork |
research on cryptographic primitives based on lattice assumptions
ⓘ
research on worst-case to average-case reductions for lattice problems ⓘ |
| occupation | professor ⓘ |
| publishesIn |
CRYPTO
ⓘ
EUROCRYPT ⓘ FOCS ⓘ SIAM Journal on Computing ⓘ STOC ⓘ
linked to:
ACM Symposium on Theory of Computing
TCC ⓘ |
| researchInterest |
algorithmic number theory
ⓘ
computational complexity ⓘ post-quantum cryptography ⓘ public-key cryptography ⓘ |
| workInstitution | University of California, San Diego ⓘ |
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: Daniele Micciancio Description of subject: Daniele Micciancio is a computer scientist known for his influential work in lattice-based cryptography and computational complexity.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.