| 2008 |
|---|
| 55 | EE | David Cash,
Eike Kiltz,
Victor Shoup:
The Twin Diffie-Hellman Problem and Applications.
EUROCRYPT 2008: 127-145 |
| 2006 |
|---|
| 54 | EE | Mihir Bellare,
Tadayoshi Kohno,
Victor Shoup:
Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation.
ACM Conference on Computer and Communications Security 2006: 380-389 |
| 2005 |
|---|
| 53 | | Victor Shoup:
Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings
Springer 2005 |
| 52 | EE | Masayuki Abe,
Rosario Gennaro,
Kaoru Kurosawa,
Victor Shoup:
Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM.
EUROCRYPT 2005: 128-146 |
| 51 | EE | Klaus Kursawe,
Victor Shoup:
Optimistic Asynchronous Atomic Broadcast.
ICALP 2005: 204-215 |
| 50 | EE | Christian Cachin,
Klaus Kursawe,
Victor Shoup:
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography.
J. Cryptology 18(3): 219-246 (2005) |
| 2004 |
|---|
| 49 | EE | Yevgeniy Dodis,
Aggelos Kiayias,
Antonio Nicolosi,
Victor Shoup:
Anonymous Identification in Ad Hoc Groups.
EUROCRYPT 2004: 609-626 |
| 2003 |
|---|
| 48 | EE | Jan Camenisch,
Victor Shoup:
Practical Verifiable Encryption and Decryption of Discrete Logarithms.
CRYPTO 2003: 126-144 |
| 47 | EE | Dan Boneh,
Ilya Mironov,
Victor Shoup:
A Secure Signature Scheme from Bilinear Maps.
CT-RSA 2003: 98-110 |
| 2002 |
|---|
| 46 | EE | Joy Algesheimer,
Jan Camenisch,
Victor Shoup:
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products.
CRYPTO 2002: 417-432 |
| 45 | EE | Ronald Cramer,
Victor Shoup:
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption.
EUROCRYPT 2002: 45-64 |
| 44 | EE | Victor Shoup,
Rosario Gennaro:
Securing Threshold Cryptosystems against Chosen Ciphertext Attack.
J. Cryptology 15(2): 75-96 (2002) |
| 43 | EE | Victor Shoup:
OAEP Reconsidered.
J. Cryptology 15(4): 223-249 (2002) |
| 2001 |
|---|
| 42 | EE | Victor Shoup:
OAEP Reconsidered.
CRYPTO 2001: 239-259 |
| 41 | EE | Christian Cachin,
Klaus Kursawe,
Frank Petzold,
Victor Shoup:
Secure and Efficient Asynchronous Broadcast Protocols.
CRYPTO 2001: 524-541 |
| 40 | EE | Ronald Cramer,
Victor Shoup:
Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Electronic Colloquium on Computational Complexity (ECCC) 8(072): (2001) |
| 2000 |
|---|
| 39 | EE | Victor Shoup:
Practical Threshold Signatures.
EUROCRYPT 2000: 207-220 |
| 38 | EE | Victor Shoup:
Using Hash Functions as a Hedge against Chosen Ciphertext Attack.
EUROCRYPT 2000: 275-288 |
| 37 | EE | Victor Shoup:
A Composition Theorem for Universal One-Way Hash Functions.
EUROCRYPT 2000: 445-452 |
| 36 | EE | John Abbott,
Victor Shoup,
Paul Zimmermann:
Factorization in ***[x]: the searching phase.
ISSAC 2000: 1-7 |
| 35 | EE | Christian Cachin,
Klaus Kursawe,
Victor Shoup:
Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract).
PODC 2000: 123-132 |
| 34 | EE | Ronald Cramer,
Victor Shoup:
Signature schemes based on the strong RSA assumption.
ACM Trans. Inf. Syst. Secur. 3(3): 161-185 (2000) |
| 33 | | Shuhong Gao,
Joachim von zur Gathen,
Daniel Panario,
Victor Shoup:
Algorithms for Exponentiation in Finite Fields.
J. Symb. Comput. 29(6): 879-889 (2000) |
| 1999 |
|---|
| 32 | EE | Ronald Cramer,
Victor Shoup:
Signature Schemes Based on the Strong RSA Assumption.
ACM Conference on Computer and Communications Security 1999: 46-51 |
| 31 | EE | Victor Shoup:
Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields.
ISSAC 1999: 53-58 |
| 30 | EE | Victor Shoup:
On the Security of a Practical Identification Scheme.
J. Cryptology 12(4): 247-260 (1999) |
| 1998 |
|---|
| 29 | EE | Ronald Cramer,
Victor Shoup:
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack.
CRYPTO 1998: 13-25 |
| 28 | EE | Victor Shoup,
Rosario Gennaro:
Securing Threshold Cryptosystems against Chosen Ciphertext Attack.
EUROCRYPT 1998: 1-16 |
| 27 | EE | N. Asokan,
Victor Shoup,
Michael Waidner:
Optimistic Fair Exchange of Digital Signatures (Extended Abstract).
EUROCRYPT 1998: 591-606 |
| 26 | | Erich Kaltofen,
Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields.
Math. Comput. 67(223): 1179-1197 (1998) |
| 1997 |
|---|
| 25 | EE | Victor Shoup:
Lower Bounds for Discrete Logarithms and Related Problems.
EUROCRYPT 1997: 256-266 |
| 24 | | Erich Kaltofen,
Victor Shoup:
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields.
ISSAC 1997: 184-188 |
| 23 | EE | Rafail Ostrovsky,
Victor Shoup:
Private Information Storage (Extended Abstract).
STOC 1997: 294-303 |
| 22 | | Victor Shoup,
Roman Smolensky:
Lower Bounds for Polynomial Evaluation and Interpolation Problems.
Computational Complexity 6(4): 301-311 (1997) |
| 1996 |
|---|
| 21 | EE | Victor Shoup:
On Fast and Provably Secure Message Authentication Based on Universal Hashing.
CRYPTO 1996: 313-328 |
| 20 | EE | Victor Shoup,
Aviel D. Rubin:
Session Key Distribution Using Smart Cards.
EUROCRYPT 1996: 321-331 |
| 19 | EE | Victor Shoup:
On the Security of a Practical Identification Scheme.
EUROCRYPT 1996: 344-353 |
| 18 | | Johannes Buchmann,
Victor Shoup:
Constructing nonresidues in finite fields and the extended Riemann hypothesis.
Math. Comput. 65(215): 1311-1326 (1996) |
| 1995 |
|---|
| 17 | EE | Erich Kaltofen,
Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields.
STOC 1995: 398-406 |
| 16 | | Victor Shoup:
A New Polynomial Factorization Algorithm and its Implementation.
J. Symb. Comput. 20(4): 363-397 (1995) |
| 1994 |
|---|
| 15 | | Frank Lehmann,
Markus Maurer,
Volker Müller,
Victor Shoup:
Counting the number of points on elliptic curves over finite fields of characteristic greater than three.
ANTS 1994: 60-70 |
| 14 | | Victor Shoup:
Fast Construction of Irreducible Polynomials over Finite Fields.
J. Symb. Comput. 17(5): 371-391 (1994) |
| 1993 |
|---|
| 13 | | Victor Shoup:
Fast Construction of Irreducible Polynomials over Finite Fields.
SODA 1993: 484-492 |
| 12 | | René Peralta,
Victor Shoup:
Primality Testing with Fewer Random Bits.
Computational Complexity 3: 355-367 (1993) |
| 1992 |
|---|
| 11 | | Joachim von zur Gathen,
Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials (Extended Abstract)
STOC 1992: 97-105 |
| 10 | | Joachim von zur Gathen,
Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials.
Computational Complexity 2: 187-224 (1992) |
| 1991 |
|---|
| 9 | | Victor Shoup,
Roman Smolensky:
Lower Bounds for Polynomial Evaluation and Interpolation Problems
FOCS 1991: 378-383 |
| 8 | EE | Victor Shoup:
A Fast Deterministic Algorithm for Factoring Polynomials over Finite Fields of Small Characteristic.
ISSAC 1991: 14-21 |
| 7 | | Johannes Buchmann,
Victor Shoup:
Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
STOC 1991: 72-79 |
| 6 | | Victor Shoup:
Smoothness and Factoring Polynomials Over Finite Fields.
Inf. Process. Lett. 38(1): 39-42 (1991) |
| 1990 |
|---|
| 5 | EE | Donald Beaver,
Joan Feigenbaum,
Victor Shoup:
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract).
CRYPTO 1990: 326-338 |
| 4 | | Victor Shoup:
Searching for Primitive Roots in Finite Fields
STOC 1990: 546-554 |
| 3 | | Victor Shoup:
On the Deterministic Complexity of Factoring Polynomials over Finite Fields.
Inf. Process. Lett. 33(5): 261-267 (1990) |
| 2 | | Eric Bach,
Victor Shoup:
Factoring Polynomials Using Fewer Random Bits.
J. Symb. Comput. 9(3): 229-239 (1990) |
| 1988 |
|---|
| 1 | | Victor Shoup:
New Algorithms for Finding Irreducible Polynomials over Finite Fields
FOCS 1988: 283-290 |
