Directed Acyclic Graphs, One-way Functions and Digital Signatures. - Daniel Bleichenbacher; Ueli M. Maurer (CRYPTO, 1994)

Some Remarks on Lucas-Based Cryptosystems. - Daniel Bleichenbacher; Wieb Bosma; Arjen K. Lenstra (CRYPTO, 1995)

On the Efficiency of One-Time Digital Signatures. - Daniel Bleichenbacher; Ueli M. Maurer (ASIACRYPT, 1996)

Generating EIGamal Signatures Without Knowing the Secret Key. - Daniel Bleichenbacher (EUROCRYPT, 1996)

Optimal Tree-Based One-Time Digital Signature Schemes. - Daniel Bleichenbacher; Ueli M. Maurer (STACS, 1996)

On the Security of the KMOV Public Key Cryptosystem. - Daniel Bleichenbacher (CRYPTO, 1997)

A new and optimal chosen-message attack on RSA-type cryptosystems. - Daniel Bleichenbacher; Marc Joye; Jean-Jacques Quisquater (ICICS, 1997)

Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1. - Daniel Bleichenbacher (CRYPTO, 1998)

On Secure and Pseudonymous Client-Relationships with Multiple Servers. - Daniel Bleichenbacher; Eran Gabber; Phillip B. Gibbons; Yossi Matias; Alain J. Mayer (USENIX Workshop on Electronic Commerce, 1998)

SOBER Crytanalysis. - Daniel Bleichenbacher; Sarvar Patel (FSE, 1999)

Noisy Polynomial Interpolation and Noisy Chinese Remaindering. - Daniel Bleichenbacher; Phong Q. Nguyen (EUROCRYPT, 2000)

Analysis of SSC2. - Daniel Bleichenbacher; Willi Meier (FSE, 2001)

Decoding of Interleaved Reed Solomon Codes over Noisy Data. - Daniel Bleichenbacher; Aggelos Kiayias; Moti Yung (ICALP, 2003)

Compressing Rabin Signatures. - Daniel Bleichenbacher (CT-RSA, 2004)

Breaking a Cryptographic Protocol with Pseudoprimes. - Daniel Bleichenbacher (Public Key Cryptography, 2005)

New Attacks on RSA with Small Secret CRT-Exponents. - Daniel Bleichenbacher; Alexander May 001 (Public Key Cryptography, 2006)

Decoding interleaved Reed-Solomon codes over noisy channels. - Daniel Bleichenbacher; Aggelos Kiayias; Moti Yung (Theor. Comput. Sci., 2007)