Demo Data from VLDB 2026 / reviewers in the wild / expert
Daniel Bleichenbacher
dblp:b/DBleichenbacher
· DBLP profile ↗
14ranked-venue papers
14as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 11 · 11 first-authorTheory of computation · 3 · 3 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
7 papers |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
2 papers |
Coding theory · 97% Graph algorithms and graph theory · 3% |
Topics — the 13 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
0.1 | 3 | 1998 | Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 · CRYPTO 1998 On the Security of the KMOV Public Key Cryptosystem · CRYPTO 1997 Some Remarks on Lucas-Based Cryptosystems · CRYPTO 1995 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.0 | 3 | 1996 | Generating EIGamal Signatures Without Knowing the Secret Key · EUROCRYPT 1996 On the Efficiency of One-Time Digital Signatures · ASIACRYPT 1996 Directed Acyclic Graphs, One-way Functions and Digital Signatures · CRYPTO 1994 |
Coding theory
error-correcting codes |
0.0 | 1 | 2003 | Decoding of Interleaved Reed Solomon Codes over Noisy Data · ICALP 2003 |
Coding theory › error-correcting codes › reed-solomon codes
interleaved reed-solomon codes |
0.0 | 1 | 2003 | Decoding of Interleaved Reed Solomon Codes over Noisy Data · ICALP 2003 |
Coding theory › error-correcting codes
reed-solomon codes |
0.0 | 1 | 2003 | Decoding of Interleaved Reed Solomon Codes over Noisy Data · ICALP 2003 |
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key cryptanalysis |
0.0 | 2 | 1997 | On the Security of the KMOV Public Key Cryptosystem · CRYPTO 1997 Some Remarks on Lucas-Based Cryptosystems · CRYPTO 1995 |
Cryptographic primitives and cryptanalysis › provable security › security notions
chosen ciphertext attack |
0.0 | 1 | 1998 | Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 · CRYPTO 1998 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
RSA encryption |
0.0 | 1 | 1998 | Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 · CRYPTO 1998 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › discrete logarithm signature
elgamal signature |
0.0 | 1 | 1996 | Generating EIGamal Signatures Without Knowing the Secret Key · EUROCRYPT 1996 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
one-time signature |
0.0 | 1 | 1996 | On the Efficiency of One-Time Digital Signatures · ASIACRYPT 1996 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › digital signature security
signature forgery |
0.0 | 1 | 1996 | Generating EIGamal Signatures Without Knowing the Secret Key · EUROCRYPT 1996 |
Cryptographic primitives and cryptanalysis
one-way functions |
0.0 | 1 | 1994 | Directed Acyclic Graphs, One-way Functions and Digital Signatures · CRYPTO 1994 |
Graph algorithms and graph theory › directed graph
directed acyclic graph |
0.0 | 1 | 1994 | Directed Acyclic Graphs, One-way Functions and Digital Signatures · CRYPTO 1994 |
Methods — techniques the papers use, named apart from their topics
lattice reduction · 0.0algebraic techniques · 0.0cryptanalysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Decoding interleaved Reed-Solomon codes over noisy channels
Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung |
Theor. Comput. Sci. | 1 |
| 2004 | Compressing Rabin Signatures
Daniel Bleichenbacher |
CT-RSA | 1 |
| 2003 | Decoding of Interleaved Reed Solomon Codes over Noisy Data
Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung |
ICALP | 1 |
| 2001 | Analysis of SSC2
Daniel Bleichenbacher, Willi Meier |
FSE | 1 |
| 2000 | Noisy Polynomial Interpolation and Noisy Chinese Remaindering
Daniel Bleichenbacher, Phong Q. Nguyen |
EUROCRYPT | 1 |
| 1999 | SOBER Crytanalysis
Daniel Bleichenbacher, Sarvar Patel |
FSE | 1 |
| 1998 | Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1
Daniel Bleichenbacher |
CRYPTO | 1 |
| 1997 | On the Security of the KMOV Public Key Cryptosystem
Daniel Bleichenbacher |
CRYPTO | 1 |
| 1997 | A new and optimal chosen-message attack on RSA-type cryptosystems
Daniel Bleichenbacher, Marc Joye, Jean-Jacques Quisquater |
ICICS | 1 |
| 1996 | On the Efficiency of One-Time Digital Signatures
Daniel Bleichenbacher, Ueli Maurer |
ASIACRYPT | 1 |
| 1996 | Generating EIGamal Signatures Without Knowing the Secret Key
Daniel Bleichenbacher |
EUROCRYPT | 1 |
| 1996 | Optimal Tree-Based One-Time Digital Signature Schemes
Daniel Bleichenbacher, Ueli Maurer |
STACS | 1 |
| 1995 | Some Remarks on Lucas-Based Cryptosystems
Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra |
CRYPTO | 1 |
| 1994 | Directed Acyclic Graphs, One-way Functions and Digital Signatures
Daniel Bleichenbacher, Ueli Maurer |
CRYPTO | 1 |