Victor Shoup

According to our database, Victor Shoup authored at least 91 papers between 1988 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience.

Victor Shoup, Nigel P. Smart

J. Cryptol., September, 2024

Blue fish, red fish, live fish, dead fish.

Victor Shoup

IACR Cryptol. ePrint Arch., 2024

A Theoretical Take on a Practical Consensus Protocol.

Victor Shoup

IACR Cryptol. ePrint Arch., 2024

MiniCast: Minimizing the Communication Complexity of Reliable Broadcast.

Thomas Locher, Victor Shoup

IACR Cryptol. ePrint Arch., 2024

Asynchronous Consensus without Trusted Setup or Public-Key Cryptography.

Sourav Das, Sisi Duan, Shengqi Liu, Atsuki Momose, Ling Ren, Victor Shoup

IACR Cryptol. ePrint Arch., 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

Sing a Song of Simplex.

Victor Shoup

Proceedings of the 38th International Symposium on Distributed Computing, 2024

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, Aman Sanghi, Victor Shoup, Terence Tsao

Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

2023

DispersedSimplex: simple and efficient atomic broadcast.

Victor Shoup

IACR Cryptol. ePrint Arch., 2023

The many faces of Schnorr.

Victor Shoup

IACR Cryptol. ePrint Arch., 2023

Fast batched asynchronous distributed key generation.

Jens Groth, Victor Shoup

IACR Cryptol. ePrint Arch., 2023

vetKeys: How a Blockchain Can Keep Many Secrets.

Andrea Cerulli, Aisling Connolly, Gregory Neven, Franz-Stefan Preiss, Victor Shoup

IACR Cryptol. ePrint Arch., 2023

2022

Design and analysis of a distributed ECDSA signing service.

Jens Groth, Victor Shoup

IACR Cryptol. ePrint Arch., 2022

2021

Bootstrapping for HElib.

Shai Halevi, Victor Shoup

J. Cryptol., 2021

On the security of ECDSA with additive key derivation and presignatures.

Jens Groth, Victor Shoup

IACR Cryptol. ePrint Arch., 2021

Internet Computer Consensus.

Jan Camenisch, Manu Drijvers, Timo Hanke, Yvonne-Anne Pignolet, Victor Shoup, Dominic Williams

IACR Cryptol. ePrint Arch., 2021

2020

Security analysis of SPAKE2+.

Victor Shoup

IACR Cryptol. ePrint Arch., 2020

Design and implementation of HElib: a homomorphic encryption library.

Shai Halevi, Victor Shoup

IACR Cryptol. ePrint Arch., 2020

Security Analysis of itSPAKE2+.

Victor Shoup

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2018

Faster Homomorphic Linear Transformations in HElib.

Shai Halevi, 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

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

2017

Implementing BP-Obfuscation Using Graph-Induced Encoding.

Shai Halevi, Tzipora Halevi, Victor Shoup, Noah Stephens-Davidowitz

IACR Cryptol. ePrint Arch., 2017

2015

GNUC: A New Universal Composability Framework.

Dennis Hofheinz, Victor Shoup

J. Cryptol., 2015

2014

Algorithms in HElib.

Shai Halevi, Victor Shoup

IACR Cryptol. ePrint Arch., 2014

2013

Practical Chosen Ciphertext Secure Encryption from Factoring.

Dennis Hofheinz, Eike Kiltz, Victor Shoup

J. Cryptol., 2013

Practical and Employable Protocols for UC-Secure Circuit Evaluation over Z_n.

Jan Camenisch, Robert R. Enderlein, Victor Shoup

IACR Cryptol. ePrint Arch., 2013

Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn.

Jan Camenisch, Robert R. Enderlein, Victor Shoup

Proceedings of the Computer Security - ESORICS 2013, 2013

2011

A Framework for Practical Universally Composable Zero-Knowledge Protocols.

Jan Camenisch, Stephan Krenn, Victor Shoup

IACR Cryptol. ePrint Arch., 2011

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

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

Credential Authenticated Identification and Key Exchange.

Jan Camenisch, Nathalie Casati, Thomas Gross, Victor Shoup

IACR Cryptol. ePrint Arch., 2010

2009

The Twin Diffie-Hellman Problem and Applications.

David Cash, Eike Kiltz, Victor Shoup

J. Cryptol., 2009

Anonymous credentials on a standard java card.

Patrik Bichsel, Jan Camenisch, Thomas Groß, Victor Shoup

Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

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

Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs.

Yevgeniy Dodis, Victor Shoup, Shabsi Walfish

Proceedings of the Advances in Cryptology, 2008

2006

Stateful Public-Key Cryptosystems: How to Encrypt with One 160-bit Exponentiation.

Mihir Bellare, Tadayoshi Kohno, Victor Shoup

IACR Cryptol. ePrint Arch., 2006

A computational introduction to number theory and algebra.

Victor Shoup

Cambridge University Press, ISBN: 978-0-521-85154-1, 2006

2005

Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography.

Christian Cachin, Klaus Kursawe, Victor Shoup

J. Cryptol., 2005

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

Proceedings of the Advances in Cryptology, 2005

2004

Sequences of games: a tool for taming complexity in security proofs.

Victor Shoup

IACR Cryptol. ePrint Arch., 2004

A Note on An Encryption Scheme of Kurosawa and Desmedt.

Rosario Gennaro, Victor Shoup

IACR Cryptol. ePrint Arch., 2004

Anonymous Identification in Ad Hoc Groups.

Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi, Victor Shoup

Proceedings of the Advances in Cryptology, 2004

2003

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack.

Ronald Cramer, Victor Shoup

SIAM J. Comput., 2003

A Secure Signature Scheme from Bilinear Maps.

Dan Boneh, Ilya Mironov, Victor Shoup

Proceedings of the Topics in Cryptology, 2003

2002

Securing Threshold Cryptosystems against Chosen Ciphertext Attack.

Victor Shoup, Rosario Gennaro

J. Cryptol., 2002

OAEP Reconsidered.

Victor Shoup

J. Cryptol., 2002

Practical Verifiable Encryption and Decryption of Discrete Logarithms.

Jan Camenisch, Victor Shoup

IACR Cryptol. ePrint Arch., 2002

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

2001

A Proposal for an ISO Standard for Public Key Encryption.

Victor Shoup

IACR Cryptol. ePrint Arch., 2001

Optimistic Asynchronous Atomic Broadcast.

Klaus Kursawe, 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

Secure and Efficient Asynchronous Broadcast Protocols.

Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup

IACR Cryptol. ePrint Arch., 2001

Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

Ronald Cramer, Victor Shoup

Electron. Colloquium Comput. Complex., 2001

2000

Signature schemes based on the strong RSA assumption.

Ronald Cramer, Victor Shoup

ACM Trans. Inf. Syst. Secur., 2000

Algorithms for Exponentiation in Finite Fields.

Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup

J. Symb. Comput., 2000

Optimistic fair exchange of digital signatures.

N. Asokan, Victor Shoup, Michael Waidner

IEEE J. Sel. Areas Commun., 2000

ACE: The Advanced Cryptographic Engine.

Thomas Schweinberger, Victor Shoup

IACR Cryptol. ePrint Arch., 2000

Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract).

Christian Cachin, Klaus Kursawe, Victor Shoup

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Factorization in ***[<i>x</i>]: the searching phase.

John Abbott, Victor Shoup, Paul Zimmermann

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

Using Hash Functions as a Hedge against Chosen Ciphertext Attack.

Victor Shoup

Proceedings of the Advances in Cryptology, 2000

1999

On the Security of a Practical Identification Scheme.

Victor Shoup

J. Cryptol., 1999

A Composition Theorem for Universal One-Way Hash Functions.

Victor Shoup

IACR Cryptol. ePrint Arch., 1999

On Formal Models for Secure Key Exchange.

Victor Shoup

IACR Cryptol. ePrint Arch., 1999

Practical Threshold Signatures.

Victor Shoup

IACR Cryptol. ePrint Arch., 1999

Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields.

Victor Shoup

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998

Subquadratic-time factoring of polynomials over finite fields.

Erich L. Kaltofen, Victor Shoup

Math. Comput., 1998

A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack.

Ronald Cramer, Victor Shoup

IACR Cryptol. ePrint Arch., 1998

Asynchronous Protocols for Optimistic Fair Exchange.

N. Asokan, Victor Shoup, Michael Waidner

Proceedings of the Security and Privacy, 1998

Optimistic Fair Exchange of Digital Signatures (Extended Abstract).

N. Asokan, Victor Shoup, Michael Waidner

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997

Lower Bounds for Polynomial Evaluation and Interpolation Problems.

Victor Shoup, Roman Smolensky

Comput. Complex., 1997

Private Information Storage (Extended Abstract).

Rafail Ostrovsky, Victor Shoup

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields.

Erich L. Kaltofen, Victor Shoup

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Lower Bounds for Discrete Logarithms and Related Problems.

Victor Shoup

Proceedings of the Advances in Cryptology, 1997

1996

Constructing nonresidues in finite fields and the extended Riemann hypothesis.

Johannes Buchmann, Victor Shoup

Math. Comput., 1996

Private Information Storage.

Rafail Ostrovsky, Victor Shoup

IACR Cryptol. ePrint Arch., 1996

Session Key Distribution Using Smart Cards.

Victor Shoup, Aviel D. Rubin

Proceedings of the Advances in Cryptology, 1996

On Fast and Provably Secure Message Authentication Based on Universal Hashing.

Victor Shoup

Proceedings of the Advances in Cryptology, 1996

1995

A New Polynomial Factorization Algorithm and its Implementation.

Victor Shoup

J. Symb. Comput., 1995

1994

Fast Construction of Irreducible Polynomials over Finite Fields.

Victor Shoup

J. Symb. Comput., 1994

Counting the number of points on elliptic curves over finite fields of characteristic greater than three.

Frank Lehmann, Markus Maurer, Volker Müller, Victor Shoup

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

Primality Testing with Fewer Random Bits.

René Peralta, Victor Shoup

Comput. Complex., 1993

1992

Computing Frobenius Maps and Factoring Polynomials.

Joachim von zur Gathen, Victor Shoup

Comput. Complex., 1992

Computing Frobenius Maps and Factoring Polynomials (Extended Abstract)

Joachim von zur Gathen, Victor Shoup

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Smoothness and Factoring Polynomials Over Finite Fields.

Victor Shoup

Inf. Process. Lett., 1991

A Fast Deterministic Algorithm for Factoring Polynomials over Finite Fields of Small Characteristic.

Victor Shoup

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990

Factoring Polynomials Using Fewer Random Bits.

Eric Bach, Victor Shoup

J. Symb. Comput., 1990

On the Deterministic Complexity of Factoring Polynomials over Finite Fields.

Victor Shoup

Inf. Process. Lett., 1990

Searching for Primitive Roots in Finite Fields

Victor Shoup

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract).

Donald Beaver, Joan Feigenbaum, Victor Shoup

Proceedings of the Advances in Cryptology, 1990

1988

New Algorithms for Finding Irreducible Polynomials over Finite Fields

Victor Shoup

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988