Victor Shoup
Artificial Intelligence · 1998–2019
A researcher in the Science corpus: 15 papers; trusts 34 researchers and is trusted by 191 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 58 citations into it; #2,058 of 36,961 by trust here, #4,822 by citations
- Computational Theory and Mathematics — 28 citations into it; #1,087 of 12,489 by trust here, #3,856 by citations
- Computer Networks and Communications — 28 citations into it; #2,715 of 9,996 by trust here, #3,163 by citations
- Privacy & Security — 20 citations into it
- Information Systems — 19 citations into it; #273 of 9,233 by trust here, #2,577 by citations
- Computer Vision and Pattern Recognition — 11 citations into it
- Algorithms & Complexity — 8 citations into it
- Discrete Mathematics and Combinatorics — 7 citations into it
Whom Victor Shoup trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Mihir Bellare
- Ronald Cramer
- Phillip Rogaway
- Craig Gentry
- Jan Camenisch
- Paul Feldman
- Amos Fiat
- Adi Shamir
- R. Rivest
- Shafi Goldwasser
Who trusts Victor Shoup overall
- Wenbo Mao
- Dan Boneh
- Yehuda Lindell
- Ronald Cramer
- Ivan Bjerre Damgård
- Dennis Hofheinz
- Gilles Barthe
- Eike Kiltz
- Jan Camenisch
- Christian Cachin
Papers from Victor Shoup's perspective
Ordered by how strongly the researchers Victor Shoup trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- New Directions in Cryptography
- Probabilistic Encryption
- A method for obtaining digital signatures and public-key cryptosystems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- Algorithms in HElib (2014) — 734 citations
- Practical Verifiable Encryption and Decryption of Discrete Logarithms (2003) — 597 citations
- Secure and Efficient Asynchronous Broadcast Protocols (2001) — 533 citations
- An Improved RNS Variant of the BFV Homomorphic Encryption Scheme (2019) — 245 citations
- Design and Implementation of a Homomorphic-Encryption Library (2012)
- A computational introduction to number theory and algebra (2005) — 726 citations
- Sequences of games: a tool for taming complexity in security proofs (2004) — 990 citations
- Anonymous Identification in Ad Hoc Groups (2004) — 316 citations
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack (2003) — 1,022 citations
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (2001) — 872 citations
- OAEP Reconsidered (2001) — 450 citations
- A Proposal for an ISO Standard for Public Key Encryption (2001) — 443 citations
- Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography (2000) — 545 citations
- Practical Threshold Signatures (2000) — 1,053 citations
- A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack (1998)