default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Bleichenbacher
Person information
- affiliation: Bell Labs
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j1]Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung:
Decoding interleaved Reed-Solomon codes over noisy channels. Theor. Comput. Sci. 379(3): 348-360 (2007)- 2006
- [c16]Daniel Bleichenbacher, Alexander May
:
New Attacks on RSA with Small Secret CRT-Exponents. Public Key Cryptography 2006: 1-13 - 2005
- [c15]Daniel Bleichenbacher:
Breaking a Cryptographic Protocol with Pseudoprimes. Public Key Cryptography 2005: 9-15 - 2004
- [c14]Daniel Bleichenbacher:
Compressing Rabin Signatures. CT-RSA 2004: 126-128 - 2003
- [c13]Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung:
Decoding of Interleaved Reed Solomon Codes over Noisy Data. ICALP 2003: 97-108 - 2001
- [c12]Daniel Bleichenbacher, Willi Meier:
Analysis of SSC2. FSE 2001: 219-232 - 2000
- [c11]Daniel Bleichenbacher, Phong Q. Nguyen:
Noisy Polynomial Interpolation and Noisy Chinese Remaindering. EUROCRYPT 2000: 53-69
1990 – 1999
- 1999
- [c10]Daniel Bleichenbacher, Sarvar Patel:
SOBER Crytanalysis. FSE 1999: 305-316 - 1998
- [c9]Daniel Bleichenbacher:
Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1. CRYPTO 1998: 1-12 - [c8]Daniel Bleichenbacher, Eran Gabber, Phillip B. Gibbons, Yossi Matias, Alain J. Mayer:
On Secure and Pseudonymous Client-Relationships with Multiple Servers. USENIX Workshop on Electronic Commerce 1998 - 1997
- [c7]Daniel Bleichenbacher:
On the Security of the KMOV Public Key Cryptosystem. CRYPTO 1997: 235-248 - [c6]Daniel Bleichenbacher, Marc Joye, Jean-Jacques Quisquater:
A new and optimal chosen-message attack on RSA-type cryptosystems. ICICS 1997: 302-313 - 1996
- [c5]Daniel Bleichenbacher, Ueli M. Maurer:
On the Efficiency of One-Time Digital Signatures. ASIACRYPT 1996: 145-158 - [c4]Daniel Bleichenbacher:
Generating EIGamal Signatures Without Knowing the Secret Key. EUROCRYPT 1996: 10-18 - [c3]Daniel Bleichenbacher, Ueli M. Maurer:
Optimal Tree-Based One-Time Digital Signature Schemes. STACS 1996: 363-374 - 1995
- [c2]Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra:
Some Remarks on Lucas-Based Cryptosystems. CRYPTO 1995: 386-396 - 1994
- [c1]Daniel Bleichenbacher, Ueli M. Maurer:
Directed Acyclic Graphs, One-way Functions and Digital Signatures. CRYPTO 1994: 75-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
