The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
Alexi, W., Chor, B., Goldreich, O., & Schnorr, C. P. (1988) · SIAM Journal on Computing · doi:10.1137/0217013 · Cited by 339
Why and how to establish a private code on a public network
Goldwasser, S., Micali, S. M., & Tong, P. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.100 · Cited by 79
The security of individual RSA bits
Håstad, J., & Näslund, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743502 · Cited by 44
Cited by
(2016) · IACR Cryptology ePrint Archive · Cited by 1,288
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_19 · Cited by 393
Cross-Tenant Side-Channel Attacks in PaaS Clouds
Zhang, Y., Juels, A., Reiter, M. K., & Ristenpart, T. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660356 · Cited by 327
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
Boneh, D., & Katz, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_8 · Cited by 283
SoK: SSL and HTTPS: Revisiting Past Challenges and Evaluating Certificate Trust Model Enhancements
Clark, J., & van Oorschot, P. C. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.41 · Cited by 224
Brubaker, C., Jana, S., Ray, B., Khurshid, S., & Shmatikov, V. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.15 · Cited by 218
Microwalk: A framework for finding side channels in binaries
Wichelmann, J., Moghimi, A., Eisenbarth, T., & Sunar, B. (2018) · Proceedings of the 34th Annual Computer Security Applications Conference · doi:10.1145/3274694.3274741 · Cited by 74
Stack Overflow Considered Harmful? The Impact of Copy&Paste on Android Application Security
Fischer, F., Bottinger, K., Xiao, H., Stransky, C., Acar, Y., Backes, M., & Fahl, S. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.31 · Cited by 280
Metadata
- Authors
- Bleichenbacher, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1998
- Pages
- 1-12
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1809974132
- Cited by
- 590
- References
- 7
- FWCI
- 14.30
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
