Victor Shoup spends much of his time researching Computer security, Theoretical computer science, Encryption, Ciphertext and Random oracle. His study focuses on the intersection of Computer security and fields such as Digital signature with connections in the field of Key, Trusted third party and The Internet. Victor Shoup combines subjects such as Mathematical proof and Asynchronous communication with his study of Theoretical computer science.
He works in the field of Encryption, namely Probabilistic encryption. Victor Shoup studied Ciphertext and Attribute-based encryption that intersect with Multiple encryption. He interconnects Schnorr signature, Oracle, Universal composability, Algorithm and Merkle signature scheme in the investigation of issues within Random oracle.
Victor Shoup mainly focuses on Theoretical computer science, Encryption, Computer security, Cryptography and Discrete mathematics. His work carried out in the field of Theoretical computer science brings together such families of science as Cramer–Shoup cryptosystem, Random oracle, Adaptive chosen-ciphertext attack, Semantic security and Scheme. His work on Ciphertext indistinguishability and Authentication is typically connected to Protocol as part of general Computer security study, connecting several disciplines of science.
His research investigates the connection between Ciphertext indistinguishability and topics such as Plaintext-aware encryption that intersect with problems in Threshold cryptosystem. His work in Discrete mathematics addresses issues such as Combinatorics, which are connected to fields such as Square-free polynomial. Within one scientific family, Victor Shoup focuses on topics pertaining to Attribute-based encryption under Probabilistic encryption, and may sometimes address concerns connected to Multiple encryption.
The scientist’s investigation covers issues in Theoretical computer science, Homomorphic encryption, Encryption, Algorithm and Scheme. His Theoretical computer science research includes elements of Mathematical proof, Plaintext-aware encryption, Cryptography and Universal composability. Victor Shoup focuses mostly in the field of Homomorphic encryption, narrowing it down to matters related to Ciphertext and, in some cases, Cryptographic primitive and Arithmetic.
Encryption is a subfield of Computer security that Victor Shoup tackles. His Algorithm research focuses on Linear map and how it relates to Focus, Software and Speedup. His Scheme research focuses on Set and how it connects with Cryptosystem, Linear algebra, SIMD, Commitment scheme and Modulo.
His scientific interests lie mostly in Homomorphic encryption, Algorithm, Scheme, Theoretical computer science and Ciphertext. His Homomorphic encryption research is multidisciplinary, incorporating perspectives in Multiplication, Cryptographic primitive, Chinese remainder theorem and Post-quantum cryptography. He has included themes like Cryptographic protocol, Mathematical proof, Compiler, Statement and Encryption in his Theoretical computer science study.
Victor Shoup has researched Encryption in several fields, including Linear map and Security level. His studies deal with areas such as Set, Linear algebra, Arithmetic, Cryptosystem and SIMD as well as Ciphertext.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
Ronald Cramer;Victor Shoup.
international cryptology conference (1998)
Lower bounds for discrete logarithms and related problems
Victor Shoup.
theory and application of cryptographic techniques (1997)
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
Ronald Cramer;Victor Shoup.
SIAM Journal on Computing (2004)
Advances in Cryptology: CRYPTO 2005
Victor Shoup.
(2005)
Practical threshold signatures
Victor Shoup.
theory and application of cryptographic techniques (2000)
A Computational Introduction to Number Theory and Algebra
Victor Shoup.
(2005)
Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption
Ronald Cramer;Victor Shoup.
Lecture Notes in Computer Science (2002)
Sequences of games: a tool for taming complexity in security proofs.
Victor Shoup.
IACR Cryptology ePrint Archive (2004)
OAEP Reconsidered
Victor Shoup.
Journal of Cryptology archive (2002)
Signature schemes based on the strong RSA assumption
Ronald Cramer;Victor Shoup.
ACM Transactions on Information and System Security (2000)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
DFINITY
University of Bern
Algorand Foundation
Ruhr University Bochum
Technical University of Darmstadt
City College of New York
University of California, Los Angeles
New York University
Facebook (United States)
ETH Zurich
National Research Council Canada
National Research Council (CNR)
Tatung University
Lancaster University
Vanderbilt University
University of Liverpool
Uppsala University
Arizona State University
University of Missouri
Medical University of South Carolina
St. Jude Children's Research Hospital
Spaulding Rehabilitation Hospital
Salk Institute for Biological Studies
University of Pennsylvania
Yale University
University of Manchester