Victor Shoup
E411765
Victor Shoup is a prominent computer scientist and cryptographer known for his foundational work in public-key cryptography, provable security, and the development of widely used cryptographic libraries.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Victor Shoup canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T3945343 — 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.
Target entity: Victor Shoup Context triple: [Mihir Bellare, coAuthor, Victor Shoup]
-
A.
Daniel J. Bernstein
Daniel J. Bernstein is an American mathematician, cryptographer, and computer scientist known for designing influential cryptographic algorithms and advocating for high-security, efficient public-key and symmetric cryptography.
-
B.
Daniele Micciancio
Daniele Micciancio is a computer scientist known for his influential work in lattice-based cryptography and computational complexity.
-
C.
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.
-
D.
Neal Koblitz
Neal Koblitz is an American mathematician best known for pioneering elliptic curve cryptography and contributing significantly to number theory and algebraic geometry.
-
E.
Hugo Krawczyk
Hugo Krawczyk is a prominent cryptographer known for foundational contributions to modern cryptographic protocols and standards, including the design of HMAC and key exchange mechanisms used in Internet security.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Victor Shoup Target entity description: Victor Shoup is a prominent computer scientist and cryptographer known for his foundational work in public-key cryptography, provable security, and the development of widely used cryptographic libraries.
-
A.
Daniel J. Bernstein
Daniel J. Bernstein is an American mathematician, cryptographer, and computer scientist known for designing influential cryptographic algorithms and advocating for high-security, efficient public-key and symmetric cryptography.
-
B.
Daniele Micciancio
Daniele Micciancio is a computer scientist known for his influential work in lattice-based cryptography and computational complexity.
-
C.
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.
-
D.
Neal Koblitz
Neal Koblitz is an American mathematician best known for pioneering elliptic curve cryptography and contributing significantly to number theory and algebraic geometry.
-
E.
Hugo Krawczyk
Hugo Krawczyk is a prominent cryptographer known for foundational contributions to modern cryptographic protocols and standards, including the design of HMAC and key exchange mechanisms used in Internet security.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
academic
ⓘ
computer scientist ⓘ cryptographer ⓘ |
| affiliation |
New York University
ⓘ
surface form:
Courant Institute of Mathematical Sciences, NYU
|
| coAuthorWith |
John Kelsey
ⓘ
surface form:
Ronald Cramer
|
| coInventorOf | Cramer–Shoup cryptosystem ⓘ |
| degree | PhD in computer science ⓘ |
| developed |
HElib homomorphic encryption library
ⓘ
NTL (Number Theory Library) ⓘ |
| doctoralAdvisor | Eric Bach ⓘ |
| educatedAt | University of Wisconsin–Madison ⓘ |
| employer | New York University ⓘ |
| fieldOfWork |
computer science
ⓘ
cryptography ⓘ number theory ⓘ provable security ⓘ public-key cryptography ⓘ |
| hasRole |
software library author
ⓘ
theorist in cryptography ⓘ |
| hasWritten |
research papers on number-theoretic algorithms
ⓘ
research papers on provable security ⓘ research papers on public-key cryptography ⓘ |
| influencedBy |
complexity theory
ⓘ
number theory ⓘ |
| knownFor |
HElib homomorphic encryption library
ⓘ
NTL (Number Theory Library) ⓘ cryptographic library design ⓘ provable security ⓘ public-key cryptography ⓘ textbook "A Computational Introduction to Number Theory and Algebra" ⓘ work on Cramer–Shoup cryptosystem ⓘ |
| languageOfWorkOrName | English ⓘ |
| nationality | American ⓘ |
| notableContribution |
contributions to practical implementations of homomorphic encryption
ⓘ
formalization of security models in public-key cryptography ⓘ |
| notableWork |
"A Computational Introduction to Number Theory and Algebra"
ⓘ
HElib homomorphic encryption library ⓘ
surface form:
HElib
NTL (Number Theory Library) ⓘ |
| occupation |
professor
ⓘ
researcher ⓘ |
| researchArea |
design and analysis of cryptographic schemes
ⓘ
efficient algorithms for number theory ⓘ security proofs for cryptographic protocols ⓘ |
| teaches |
cryptography
ⓘ
number theory ⓘ |
| workInstitution |
New York University
ⓘ
surface form:
Courant Institute of Mathematical Sciences
|
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.
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.
Subject: Victor Shoup Description of subject: Victor Shoup is a prominent computer scientist and cryptographer known for his foundational work in public-key cryptography, provable security, and the development of widely used cryptographic libraries.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.