New Algorithms for Finding Irreducible Polynomials over Finite Fields - Victor Shoup (FOCS, 1988)

Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract). - Donald Beaver; Joan Feigenbaum; Victor Shoup (CRYPTO, 1990)

Searching for Primitive Roots in Finite Fields - Victor Shoup (STOC, 1990)

On the Deterministic Complexity of Factoring Polynomials over Finite Fields. - Victor Shoup (Inf. Process. Lett., 1990)

Factoring Polynomials Using Fewer Random Bits. - Eric Bach 001; Victor Shoup (J. Symb. Comput., 1990)

A Fast Deterministic Algorithm for Factoring Polynomials over Finite Fields of Small Characteristic. - Victor Shoup (ISSAC, 1991)

Smoothness and Factoring Polynomials Over Finite Fields. - Victor Shoup (Inf. Process. Lett., 1991)

Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) - Joachim von zur Gathen; Victor Shoup (STOC, 1992)

Computing Frobenius Maps and Factoring Polynomials. - Joachim von zur Gathen; Victor Shoup (Comput. Complex., 1992)

Primality Testing with Fewer Random Bits. - René Peralta 001; Victor Shoup (Comput. Complex., 1993)

Counting the number of points on elliptic curves over finite fields of characteristic greater than three. - Frank Lehmann 003; Markus Maurer; Volker Müller 001; Victor Shoup (ANTS, 1994)

Fast Construction of Irreducible Polynomials over Finite Fields. - Victor Shoup (J. Symb. Comput., 1994)

A New Polynomial Factorization Algorithm and its Implementation. - Victor Shoup (J. Symb. Comput., 1995)

On Fast and Provably Secure Message Authentication Based on Universal Hashing. - Victor Shoup (CRYPTO, 1996)

Session Key Distribution Using Smart Cards. - Victor Shoup; Aviel D. Rubin (EUROCRYPT, 1996)

Private Information Storage. - Rafail Ostrovsky; Victor Shoup (IACR Cryptol. ePrint Arch., 1996)

Constructing nonresidues in finite fields and the extended Riemann hypothesis. - Johannes Buchmann 001; Victor Shoup (Math. Comput., 1996)

Lower Bounds for Discrete Logarithms and Related Problems. - Victor Shoup (EUROCRYPT, 1997)

Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. - Erich L. Kaltofen; Victor Shoup (ISSAC, 1997)

Private Information Storage (Extended Abstract). - Rafail Ostrovsky; Victor Shoup (STOC, 1997)

Lower Bounds for Polynomial Evaluation and Interpolation Problems. - Victor Shoup; Roman Smolensky (Comput. Complex., 1997)

Optimistic Fair Exchange of Digital Signatures (Extended Abstract). - N. Asokan; Victor Shoup; Michael Waidner (EUROCRYPT, 1998)

Asynchronous Protocols for Optimistic Fair Exchange. - N. Asokan; Victor Shoup; Michael Waidner (S&P, 1998)

A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. - Ronald Cramer; Victor Shoup (IACR Cryptol. ePrint Arch., 1998)

Subquadratic-time factoring of polynomials over finite fields. - Erich L. Kaltofen; Victor Shoup (Math. Comput., 1998)

Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields. - Victor Shoup (ISSAC, 1999)

Practical Threshold Signatures. - Victor Shoup (IACR Cryptol. ePrint Arch., 1999)

On Formal Models for Secure Key Exchange. - Victor Shoup (IACR Cryptol. ePrint Arch., 1999)

A Composition Theorem for Universal One-Way Hash Functions. - Victor Shoup (IACR Cryptol. ePrint Arch., 1999)

On the Security of a Practical Identification Scheme. - Victor Shoup (J. Cryptol., 1999)

Using Hash Functions as a Hedge against Chosen Ciphertext Attack. - Victor Shoup (EUROCRYPT, 2000)

Factorization in ***[x]: the searching phase. - John Abbott; Victor Shoup; Paul Zimmermann (ISSAC, 2000)

Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract). - Christian Cachin; Klaus Kursawe; Victor Shoup (PODC, 2000)

ACE: The Advanced Cryptographic Engine. - Thomas Schweinberger; Victor Shoup (IACR Cryptol. ePrint Arch., 2000)

Optimistic fair exchange of digital signatures. - N. Asokan; Victor Shoup; Michael Waidner (IEEE J. Sel. Areas Commun., 2000)

Algorithms for Exponentiation in Finite Fields. - Shuhong Gao; Joachim von zur Gathen; Daniel Panario; Victor Shoup (J. Symb. Comput., 2000)

Signature schemes based on the strong RSA assumption. - Ronald Cramer; Victor Shoup (ACM Trans. Inf. Syst. Secur., 2000)

Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption - Ronald Cramer; Victor Shoup (Electron. Colloquium Comput. Complex., 2001)

Secure and Efficient Asynchronous Broadcast Protocols. - Christian Cachin; Klaus Kursawe; Frank Petzold; Victor Shoup (IACR Cryptol. ePrint Arch., 2001)

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. - Ronald Cramer; Victor Shoup (IACR Cryptol. ePrint Arch., 2001)

Optimistic Asynchronous Atomic Broadcast. - Klaus Kursawe; Victor Shoup (IACR Cryptol. ePrint Arch., 2001)

A Proposal for an ISO Standard for Public Key Encryption. - Victor Shoup (IACR Cryptol. ePrint Arch., 2001)

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. - Joy Algesheimer; Jan Camenisch; Victor Shoup (IACR Cryptol. ePrint Arch., 2002)

Practical Verifiable Encryption and Decryption of Discrete Logarithms. - Jan Camenisch; Victor Shoup (IACR Cryptol. ePrint Arch., 2002)

OAEP Reconsidered. - Victor Shoup (J. Cryptol., 2002)

Securing Threshold Cryptosystems against Chosen Ciphertext Attack. - Victor Shoup; Rosario Gennaro (J. Cryptol., 2002)

A Secure Signature Scheme from Bilinear Maps. - Dan Boneh; Ilya Mironov; Victor Shoup (CT-RSA, 2003)

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack. - Ronald Cramer; Victor Shoup (SIAM J. Comput., 2003)

Anonymous Identification in Ad Hoc Groups. - Yevgeniy Dodis; Aggelos Kiayias; Antonio Nicolosi; Victor Shoup (EUROCRYPT, 2004)

A Note on An Encryption Scheme of Kurosawa and Desmedt. - Rosario Gennaro; Victor Shoup (IACR Cryptol. ePrint Arch., 2004)

Sequences of games: a tool for taming complexity in security proofs. - Victor Shoup (IACR Cryptol. ePrint Arch., 2004)

Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM. - Masayuki Abe; Rosario Gennaro; Kaoru Kurosawa; Victor Shoup (EUROCRYPT, 2005)

Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography. - Christian Cachin; Klaus Kursawe; Victor Shoup (J. Cryptol., 2005)

A computational introduction to number theory and algebra. - Victor Shoup (Cambridge University Press, 2006)

Stateful Public-Key Cryptosystems: How to Encrypt with One 160-bit Exponentiation. - Mihir Bellare; Tadayoshi Kohno; Victor Shoup (IACR Cryptol. ePrint Arch., 2006)

Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs. - Yevgeniy Dodis; Victor Shoup; Shabsi Walfish (CRYPTO, 2008)

A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. - Jan Camenisch; Nishanth Chandran; Victor Shoup (IACR Cryptol. ePrint Arch., 2008)

Anonymous credentials on a standard java card. - Patrik Bichsel; Jan Camenisch; Thomas Groß 001; Victor Shoup (CCS, 2009)

The Twin Diffie-Hellman Problem and Applications. - David Cash; Eike Kiltz; Victor Shoup (J. Cryptol., 2009)

Credential Authenticated Identification and Key Exchange. - Jan Camenisch; Nathalie Casati; Thomas Gross 001; Victor Shoup (IACR Cryptol. ePrint Arch., 2010)

Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model. - Kristiyan Haralambiev; Tibor Jager; Eike Kiltz; Victor Shoup (IACR Cryptol. ePrint Arch., 2010)

A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack. - Yvo Desmedt; Rosario Gennaro; Kaoru Kurosawa; Victor Shoup (J. Cryptol., 2010)

A Framework for Practical Universally Composable Zero-Knowledge Protocols. - Jan Camenisch; Stephan Krenn; Victor Shoup (IACR Cryptol. ePrint Arch., 2011)

Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn. - Jan Camenisch; Robert R. Enderlein; Victor Shoup (ESORICS, 2013)

Practical and Employable Protocols for UC-Secure Circuit Evaluation over Zn. - Jan Camenisch; Robert R. Enderlein; Victor Shoup (IACR Cryptol. ePrint Arch., 2013)

Practical Chosen Ciphertext Secure Encryption from Factoring. - Dennis Hofheinz; Eike Kiltz; Victor Shoup (J. Cryptol., 2013)

Algorithms in HElib. - Shai Halevi; Victor Shoup (IACR Cryptol. ePrint Arch., 2014)

GNUC: A New Universal Composability Framework. - Dennis Hofheinz; Victor Shoup (J. Cryptol., 2015)

Implementing BP-Obfuscation Using Graph-Induced Encoding. - Shai Halevi; Tzipora Halevi; Victor Shoup; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2017)

Doing Real Work with FHE: The Case of Logistic Regression. - Jack L. H. Crawford; Craig Gentry; Shai Halevi; Daniel Platt; Victor Shoup (IACR Cryptol. ePrint Arch., 2018)

An Improved RNS Variant of the BFV Homomorphic Encryption Scheme. - Shai Halevi; Yuriy Polyakov; Victor Shoup (IACR Cryptol. ePrint Arch., 2018)

Faster Homomorphic Linear Transformations in HElib. - Shai Halevi; Victor Shoup (IACR Cryptol. ePrint Arch., 2018)

Security Analysis of itSPAKE2+. - Victor Shoup (TCC (3), 2020)

Design and implementation of HElib: a homomorphic encryption library. - Shai Halevi; Victor Shoup (IACR Cryptol. ePrint Arch., 2020)

Security analysis of SPAKE2+. - Victor Shoup (IACR Cryptol. ePrint Arch., 2020)

Internet Computer Consensus. - Jan Camenisch; Manu Drijvers; Timo Hanke; Yvonne-Anne Pignolet; Victor Shoup; Dominic Williams 003 (IACR Cryptol. ePrint Arch., 2021)

On the security of ECDSA with additive key derivation and presignatures. - Jens Groth; Victor Shoup (IACR Cryptol. ePrint Arch., 2021)

Bootstrapping for HElib. - Shai Halevi; Victor Shoup (J. Cryptol., 2021)

Design and analysis of a distributed ECDSA signing service. - Jens Groth; Victor Shoup (IACR Cryptol. ePrint Arch., 2022)

vetKeys: How a Blockchain Can Keep Many Secrets. - Andrea Cerulli; Aisling Connolly; Gregory Neven; Franz-Stefan Preiss; Victor Shoup (IACR Cryptol. ePrint Arch., 2023)

Fast batched asynchronous distributed key generation. - Jens Groth; Victor Shoup (IACR Cryptol. ePrint Arch., 2023)

The many faces of Schnorr. - Victor Shoup (IACR Cryptol. ePrint Arch., 2023)

DispersedSimplex: simple and efficient atomic broadcast. - Victor Shoup (IACR Cryptol. ePrint Arch., 2023)

BoLD: Fast and Cheap Dispute Resolution. - Mario M. Alvarez; Henry Arneson; Ben Berger; Lee Bousfield; Chris Buckland; Yafah Edelman; Edward W. Felten; Daniel Goldman; Raul Jordan; Mahimna Kelkar; Akaki Mamageishvili; Harry Ng; et al. (AFT, 2024)

Sing a Song of Simplex. - Victor Shoup (DISC, 2024)

A New Broadcast Primitive for BFT Protocols. - Manu Drijvers; Tim Gretler; Yotam Harchol; Tobias Klenze; Ognjen Maric; Stefan Neamtu; Yvonne-Anne Pignolet; Rostislav Rumenov; Daniel Sharifi; Victor Shoup (CoRR, 2024)

Asynchronous Consensus without Trusted Setup or Public-Key Cryptography. - Sourav Das 001; Sisi Duan; Shengqi Liu; Atsuki Momose; Ling Ren 001; Victor Shoup (IACR Cryptol. ePrint Arch., 2024)

MiniCast: Minimizing the Communication Complexity of Reliable Broadcast. - Thomas Locher; Victor Shoup (IACR Cryptol. ePrint Arch., 2024)

A Theoretical Take on a Practical Consensus Protocol. - Victor Shoup (IACR Cryptol. ePrint Arch., 2024)

Blue fish, red fish, live fish, dead fish. - Victor Shoup (IACR Cryptol. ePrint Arch., 2024)

Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience. - Victor Shoup; Nigel P. Smart (J. Cryptol., 2024)

The many faces of Schnorr: a toolkit for the modular design of threshold Schnorr signatures. - Victor Shoup (IACR Commun. Cryptol., 2025)

Context-Dependent Threshold Decryption and its Applications. - Dan Boneh; Benedikt Bünz; Kartik Nayak; Lior Rotem; Victor Shoup (IACR Cryptol. ePrint Arch., 2025)

Improving the Round Complexity of MiniCast. - Thomas Locher; Victor Shoup (IACR Cryptol. ePrint Arch., 2025)

Simple VESS. - Victor Shoup (IACR Cryptol. ePrint Arch., 2025)

Kudzu: Fast and Simple High-Throughput BFT. - Victor Shoup; Jakub Sliwinski; Yann Vonlanthen (CoRR, 2025)