| 1996 | An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding. | Jean-Bernard Fischer, Jacques Stern |
| 1996 | New Convertible Undeniable Signature Schemes. | Ivan Damgrd, Torben P. Pedersen |
| 1996 | Multi-Autority Secret-Ballot Elections with Linear Work. | Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung |
| 1996 | Low-Exponent RSA with Related Messages. | Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter |
| 1996 | Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. | Don Coppersmith |
| 1996 | Finding a Small Root of a Univariate Modular Equation. | Don Coppersmith |
| 1996 | Construction of t-Resilient Functions over a Finite Alphabet. | Paul Camion, Anne Canteaut |
| 1996 | Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing. | Mike Burmester |
| 1996 | Short Discrete Proofs. | Joan Boyar, Ren Peralta |
| 1996 | Generating EIGamal Signatures Without Knowing the Secret Key. | Daniel Bleichenbacher |
| 1996 | Efficient Multiplicative Sharing Schemes. | Simon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild |
| 1996 | The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin. | Mihir Bellare, Phillip Rogaway |
| 1996 | Equivocable Oblivious Transfer. | Donald Beaver |
| 1996 | Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. | William Aiello, Ramarathnam Venkatesan |
| 1995 | On Nonlinear Resilient Functions (Extended Abstract). | Xian-Mo Zhang, Yuliang Zheng |
| 1995 | An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p. | Damian Weber |
| 1995 | On the Matsumoto and Imai's Human Identification Scheme. | Chih-Hung Wang, Tzonelih Hwang, Jiun-Jang Tsai |
| 1995 | Fair Blind Signatures. | Markus Stadler, Jean-Marc Piveteau, Jan Camenisch |
| 1995 | Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. | Claus-Peter Schnorr, Horst Helmut Hrner |
| 1995 | Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems. | Kouichi Sakurai, Hiroki Shizuya |
| 1995 | Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. | Kazue Sako, Joe Kilian |
| 1995 | A New Identification Scheme Based on the Perceptrons Problem. | David Pointcheval |
| 1995 | How to Break Another Provably Secure Payment System. | Birgit Pfitzmann, Matthias Schunter, Michael Waidner |
| 1995 | Convergence in Differential Distributions. | Luke O'Connor |
| 1995 | Universal Hash Functions & Hard Core Bits. | Mats Nslund |