V. Shoup

发表

Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography

Victor Shoup, Klaus Kursawe, Christian Cachin, 2000, Journal of Cryptology.

On Formal Models for Secure Key Exchange

Victor Shoup, V. Shoup, 1999, IACR Cryptol. ePrint Arch..

Credential Authenticated Identification and Key Exchange

Jan Camenisch, Thomas Gross, Victor Shoup, 2010, IACR Cryptol. ePrint Arch..

Efficient Cryptographic Primitives for Non-Interactive Zero-Knowledge Proofs and Applications

V. Shoup, Kristiyan Haralambiev, 2011 .

A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks

Jan Camenisch, Victor Shoup, Nishanth Chandran, 2009, IACR Cryptol. ePrint Arch..

New algorithms for finding irreducible polynomials over finite fields

Victor Shoup, V. Shoup, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

Factoring polynomials over finite fields: Asymptotic complexity vs. reality

V. Shoup, 1993 .

Design and Implementation of a Homomorphic-Encryption Library

S. Halevi, V. Shoup, 2012 .

Secure and Efficient Asynchronous Broadcast Protocols

Victor Shoup, Klaus Kursawe, Frank Petzold, 2001, CRYPTO.

Optimistic fair exchange of digital signatures

N. Asokan, Victor Shoup, Michael Waidner, 1998, IEEE Journal on Selected Areas in Communications.

GNUC: A New Universal Composability Framework

Dennis Hofheinz, Victor Shoup, V. Shoup, 2015, Journal of Cryptology.

New algorithms for finding irreducible polynomials over finite fields

V. Shoup, 1990 .

Practical Verifiable Encryption and Decryption of Discrete Logarithms

Jan Camenisch, Victor Shoup, V. Shoup, 2003, CRYPTO.

Using Hash Functions as a Hedge against Chosen Ciphertext Attack

Victor Shoup, V. Shoup, 2000, EUROCRYPT.

Why Chosen Ciphertext Security Matters

Victor Shoup, V. Shoup, 2000 .

Anonymous credentials on a standard java card

Jan Camenisch, Victor Shoup, Patrik Bichsel, 2009, CCS.

Searching for primitive roots in finite fields

V. Shoup, 1990, Symposium on the Theory of Computing.

Lower Bounds for Discrete Logarithms and Related Problems

Victor Shoup, V. Shoup, 1997, EUROCRYPT.

Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model

Tibor Jager, Eike Kiltz, Kristiyan Haralambiev, 2010, Public Key Cryptography.

Removing randomness from computational number theory

V. Shoup, E. Bach, 1989 .

Computing Frobenius maps and factoring polynomials

Joachim von zur Gathen, Victor Shoup, V. Shoup, 1992, STOC '92.

ACE Encrypt: The Advanced Cryptographic Engine's Public Key Encryption Scheme

V. Shoup, T. Schweinberger, 2000 .

A Computational Introduction to Number Theory and Algebra: Quadratic reciprocity and computing modular square roots

V. Shoup, 2008 .

Building Dependable Trusted Services

Victor Shoup, Klaus Kursawe, Christian Cachin, 2003 .

Course in Applied Cryptography

Dan Boneh, Victor Shoup, V. Shoup, 2015 .

A Computational Introduction to Number Theory and Algebra: Frontmatter

V. Shoup, 2005 .

Proof of history: what is it good for?

V. Shoup, 2022 .

Design and analysis of a distributed ECDSA signing service

V. Shoup, Jens Groth, 2022, IACR Cryptol. ePrint Arch..

MAFTIA: Reference Model and Use Cases

Birgit Pfitzmann, John E. Dobson, Paulo Veríssimo, 2000 .

Counting the number of points on elliptic curves of characteristic greater than three

V. Shoup, F. Lehmann, M. Mauerer, 1994 .

Information technology-Security techniques-Encryption algorithms-Part 2 : Asymmetric Ciphers

V. Shoup, V. Shoup, 2004 .

Research Report Securing Threshold Cryptosystems against Chosen Ciphertext Attack Securing Threshold Cryptosystems against Chosen Ciphertext Attack

T. J. Watson, V. Shoup, R. Gennaro, 1998 .

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

C. Cachin, K. Kursawe, V. Shoup, 2000, PODC '00.

Bootstrapping for HElib

S. Halevi, V. Shoup, 2021, Journal of Cryptology.

Practical Chosen Ciphertext Secure Encryption from Factoring

Eike Kiltz, Dennis Hofheinz, Victor Shoup, 2009, Journal of Cryptology.

Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation

Mihir Bellare, Tadayoshi Kohno, Victor Shoup, 2006, CCS '06.

A computational introduction to number theory and algebra

Victor Shoup, V. Shoup, 2005 .

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

Victor Shoup, V. Shoup, 2004, IACR Cryptol. ePrint Arch..

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

Ronald Cramer, Victor Shoup, R. Cramer, 2003, SIAM J. Comput..

OAEP Reconsidered

Victor Shoup, V. Shoup, 2002, Journal of Cryptology.

ACE: The Advanced Cryptographic Engine

Victor Shoup, Thomas Schweinberger, V. Shoup, 2000, IACR Cryptol. ePrint Arch..

A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

Ronald Cramer, Victor Shoup, R. Cramer, 1998, CRYPTO.

Research Report Why Chosen Ciphertext Security Matters Why Chosen Ciphertext Security Matters

Victor Shoup, V. Shoup, 1998 .

On Fast and Provably Secure Message Authentication Based on Universal Hashing

Victor Shoup, V. Shoup, 1996, CRYPTO.

Session Key Distribution Using Smart Cards

Victor Shoup, Aviel D. Rubin, V. Shoup, 1996, EUROCRYPT.

Subquadratic-time factoring of polynomials over finite fields

Erich Kaltofen, Victor Shoup, V. Shoup, 1995, STOC '95.

Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM

Kaoru Kurosawa, Rosario Gennaro, Victor Shoup, 2005, EUROCRYPT.

A Note on An Encryption Scheme of Kurosawa and Desmedt

Rosario Gennaro, Victor Shoup, V. Shoup, 2004, IACR Cryptol. ePrint Arch..

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

Ronald Cramer, Victor Shoup, R. Cramer, 2001, EUROCRYPT.

Optimistic Fair Exchange of Digital Signatures (Extended Abstract)

N. Asokan, Victor Shoup, Michael Waidner, 1998, EUROCRYPT.

A Proposal for an ISO Standard for Public Key Encryption

Victor Shoup, V. Shoup, 2001, IACR Cryptol. ePrint Arch..

Signature schemes based on the strong RSA assumption

Ronald Cramer, Victor Shoup, R. Cramer, 2000, TSEC.

Practical Threshold Signatures

Victor Shoup, V. Shoup, 2000, EUROCRYPT.

Faster Homomorphic Linear Transformations in HElib

Shai Halevi, Victor Shoup, S. Halevi, 2018, IACR Cryptol. ePrint Arch..

Algorithms in HElib

Shai Halevi, Victor Shoup, S. Halevi, 2014, CRYPTO.

Asynchronous protocols for optimistic fair exchange

N. Asokan, Victor Shoup, Michael Waidner, 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

Bootstrapping for HElib

Shai Halevi, Victor Shoup, S. Halevi, 2015, EUROCRYPT.

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

Jan Camenisch, Robert R. Enderlein, Victor Shoup, 2013, ESORICS.

A Composition Theorem for Universal One-Way Hash Functions

Victor Shoup, V. Shoup, 2000, EUROCRYPT.

A computational introduction to number theory and algebra

V. Shoup, 2005 .

A Framework for Practical Universally Composable Zero-Knowledge Protocols

Jan Camenisch, Victor Shoup, Stephan Krenn, 2011, IACR Cryptol. ePrint Arch..

Fast polynomial factorization over high algebraic extensions of finite fields

Erich Kaltofen, Victor Shoup, V. Shoup, 1997, ISSAC.

Fast construction of irreducible polynomials over finite fields

Victor Shoup, V. Shoup, 1994, SODA '93.

Primality testing with fewer random bits

Victor Shoup, René Peralta, V. Shoup, 1993, computational complexity.

Smoothness and Factoring Polynomials Over Finite Fields

Victor Shoup, V. Shoup, 1991, Inf. Process. Lett..

Searching for primitive roots in finite fields

Victor Shoup, V. Shoup, 1990, STOC '90.

Implementing BP-Obfuscation Using Graph-Induced Encoding

Shai Halevi, Tzipora Halevi, Noah Stephens-Davidowitz, 2017, CCS.

Design and implementation of HElib: a homomorphic encryption library

Shai Halevi, Victor Shoup, S. Halevi, 2020, IACR Cryptol. ePrint Arch..

vetKeys: How a Blockchain Can Keep Many Secrets

V. Shoup, G. Neven, Franz-Stefan Preiss, 2023, IACR Cryptology ePrint Archive.

Securing Threshold Cryptosystems against Chosen Ciphertext Attack

Rosario Gennaro, Victor Shoup, V. Shoup, 1998, Journal of Cryptology.

On the security of ECDSA with additive key derivation and presignatures

Victor Shoup, Jens Groth, V. Shoup, 2021, IACR Cryptol. ePrint Arch..

Algorithms for Exponentiation in Finite Fields

Joachim von zur Gathen, Daniel Panario, Shuhong Gao, 2000, J. Symb. Comput..

Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

Yevgeniy Dodis, Victor Shoup, Shabsi Walfish, 2008, CRYPTO.

Anonymous Identification in Ad Hoc Groups

Aggelos Kiayias, Yevgeniy Dodis, Victor Shoup, 2004, EUROCRYPT.

OAEP Reconsidered

Victor Shoup, V. Shoup, 2001, CRYPTO.

The Twin Diffie–Hellman Problem and Applications

David Cash, Eike Kiltz, Victor Shoup, 2009, Journal of Cryptology.

Fast batched asynchronous distributed key generation

V. Shoup, Jens Groth, 2023, IACR Cryptol. ePrint Arch..

A Secure Signature Scheme from Bilinear Maps

Dan Boneh, Victor Shoup, Ilya Mironov, 2003, CT-RSA.

A New Polynomial Factorization Algorithm and its Implementation

Victor Shoup, V. Shoup, 1995, J. Symb. Comput..

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

Markus Maurer, Victor Shoup, Frank Lehmann, 1994, ANTS.

Optimistic Asynchronous Atomic Broadcast

Victor Shoup, Klaus Kursawe, K. Kursawe, 2005, ICALP.

Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience

V. Shoup, N. Smart, 2023, IACR Cryptol. ePrint Arch..

Private information storage (extended abstract)

Rafail Ostrovsky, Victor Shoup, V. Shoup, 1997, STOC '97.

Private Information Storage

Rafail Ostrovsky, Victor Shoup, V. Shoup, 1996, IACR Cryptol. ePrint Arch..

An Improved RNS Variant of the BFV Homomorphic Encryption Scheme

Shai Halevi, Victor Shoup, Yuriy Polyakov, 2019, IACR Cryptol. ePrint Arch..

Primality Testing with Fewer Random Bits 1

V. Shoup, 2007 .

Doing Real Work with FHE: The Case of Logistic Regression

Craig Gentry, Shai Halevi, Victor Shoup, 2018, IACR Cryptol. ePrint Arch..

Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM

V. Shoup, K. Kurosawa, R. Gennaro, 2005, EUROCRYPT.

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

Jan Camenisch, Victor Shoup, Joy Algesheimer, 2002, CRYPTO.

Arithmetic Software Libraries

V. Shoup, 2021, Computational Cryptography.

Factorization in Z[x]: the searching phase

Victor Shoup, Paul Zimmermann, John Abbott, 2000, ISSAC.

Signature schemes based on the strong RSA assumption

Ronald Cramer, Victor Shoup, R. Cramer, 1999, CCS '99.

Reference Model and Use Cases

Marc Dacier, Birgit Pfitzmann, John E. Dobson, 2000 .

Private Information Storage

V. Shoup, R. Ostrovsky, 1996, IACR Cryptol. ePrint Arch..

Constructing nonresidues in finite fields and the extended Riemann hypothesis

Victor Shoup, Johannes A. Buchmann, V. Shoup, 1991, STOC '91.

Security analysis of SPAKE2+

Victor Shoup, V. Shoup, 2020, IACR Cryptol. ePrint Arch..

Optimistic Fair Exchange of Digital Signatures (Extended Abstract).

V. Shoup, N. Asokan, M. Waidner, 1998 .

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

C. Cachin, K. Kursawe, V. Shoup, 2000, PODC '00.

Constructing nonresidues in finite fields riemann hypothesis (Preliminary Version)

Johannes Buchmann, Victor Shoup, V. Shoup, 1991, Symposium on the Theory of Computing.

Security Analysis of itSPAKE2+

Victor Shoup, V. Shoup, 2020, Theory of Cryptography Conference.