Shoup, Victor - Computer Science Department, Courant Institute of Mathematical Sciences, New York University

• Lower Bounds for Discrete Logarithms and Related Problems ?
• InstanceHiding Proof Systems \Lambda D. Beaver y J. Feigenbaum z R. Ostrovsky x V. Shoup --
• Primality Testing with Fewer Random Bits 1 Ren'e Peralta 2
• Smoothness and Factoring Polynomials over Finite Fields \Lambda Victor Shoup y
• A New Polynomial Factorization Algorithm and its Implementation \Lambda Victor Shoup
• Factoring Polynomials over Finite Fields: Asymptotic Complexity vs. Reality \Lambda
• A Proposal for an ISO Standard for Public Key Encryption (version 1.1)
• Factorization in Z[x]: The Searching Phase John Abbott
• Lower Bounds for Polynomial Evaluation and Interpolation Problems \Lambda
• Searching for Primitive Roots in Finite Fields Victor Shoup
• SubquadraticTime Factoring of Polynomials over Finite Fields \Lambda
• Practical Threshold Signatures Victor Shoup
• Signature Schemes Based on the Strong RSA Assumption Ronald Cramer
• Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using
• Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields \Lambda
• Design and Analysis of Practical PublicKey Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Securing Threshold Cryptosystems against Chosen Ciphertext Victor Shoup y Rosario Gennaro z
• OAEP Reconsidered Victor Shoup
• Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields \Lambda
• A Proposal for an ISO Standard for Public Key Victor Shoup
• New Algorithms for Finding Irreducible Polynomials over Finite Fields Victor Shoup
• A Secure Signature Scheme from Bilinear Maps Dan Boneh # Ilya Mironov ## Victor Shoup
• Anonymous Credentials on Java Card Patrik Bichsel1
• Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
• A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack
• An extended abstract of this paper appears in Advances in Cryptology --EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the full
• Tag-KEM/DEM: A New Framework for Hybrid Encryption and New Analysis of
• Anonymous Identification in Ad Hoc Groups Yevgeniy Dodis1
• A Proposal for an ISO Standard for Public Key Encryption (version 2.0)
• Securing Threshold Cryptosystems against Chosen Ciphertext Victor Shoup
• A Fast Deterministic Algorithm for Factoring Polynomials over Finite Fields of Small Characteristic
• A Composition Theorem for Universal One-Way Hash Functions
• Private Information Storage (Extended Abstract)
• Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
• Factoring Polynomials Using Fewer Random Bits Victor Shoup
• COMPUTING FROBENIUS MAPS AND FACTORING POLYNOMIALS
• Optimistic Fair Exchange of Digital Signatures N. Asokan y Victor Shoup z Michael Waidner z
• Credential Authenticated Identification and Key Exchange Jan Camenisch
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Using Hash Functions as a Hedge against Chosen Ciphertext Attack
• Algorithms for exponentiation in finite fields SHUHONG GAO y , JOACHIM VON ZUR GATHEN z ,
• A Proposal for an ISO Standard for Public Key Victor Shoup
• OAEP Reconsidered Victor Shoup
• Anonymous Credentials on a Standard Java Card Patrik Bichsel
• A Proposal for an ISO Standard for Public Key Encryption (version 2.0)
• Session Key Distribution Using Smart Cards Victor Shoup Avi Rubin
• Fast Construction of Irreducible Polynomials over Finite Fields \Lambda Victor Shoup
• Counting the number of points on elliptic curves over finite fields of characteristic greater than three \Lambda
• A Note on Session Key Distribution Using Smart Cards Victor Shoup
• REMOVING RANDOMNESS FROM COMPUTATIONAL NUMBER THEORY
• On the Security of a Practical Identification Scheme \Lambda Victor Shoup
• On the Deterministic Complexity of Factoring Polynomials over Finite Fields Victor Shoup
• !#"$%&')(0214356!7"8 9@BADCFEHGPIQRETSRU
• RZ 3076 (#93122) 23/11/1998 Computer Science/Mathematics 25 pages
• A Framework for Practical Universally Composable Zero-Knowledge Protocols
• Practical Chosen Ciphertext Secure Encryption from Factoring Dennis Hofheinz1