The Security of Cipher Block Chaining
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Self-citationEfficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
Self-citationEfficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Self-citationKeying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Self-citationEfficient authentication and signing of multicast streams over lossy channels
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848446 · Cited by 946
A concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Self-citationBellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
Self-citationAuthenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_41 · Cited by 879
Self-citationExtending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Self-citationReconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*
Abadi, M., & Rogaway, P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0014-7 · Cited by 613
Self-citationThe Security of the Cipher Block Chaining Message Authentication Code
Bellare, M., Kilian, J., & Rogaway, P. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1694 · Cited by 596
Self-citationThe Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
Abdalla, M., Bellare, M., & Rogaway, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_12 · Cited by 445
Self-citationKey-Privacy in Public-Key Encryption
Bellare, M., Boldyreva, A., Desai, A., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_33 · Cited by 442
Self-citationThe 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
UMAC: Fast and Secure Message Authentication
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., & Rogaway, P. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_14 · Cited by 390
Self-citationTowards realizing random oracles: Hash functions that hide all partial information
Canetti, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052255 · Cited by 365
Incremental Cryptography: The Case of Hashing and Signing
Bellare, M., Goldreich, O., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_22 · Cited by 312
Self-citationFan, J., Xu, J., Ammar, M. H., & Moon, S. B. (2004) · Computer Networks · doi:10.1016/j.comnet.2004.03.033 · Cited by 288
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
Naor, M., & Reingold, O. (1999) · Journal of Cryptology · doi:10.1007/pl00003817 · Cited by 285
Forward-Security in Private-Key Cryptography
Bellare, M., & Yee, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_1 · Cited by 275
Self-citationModern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
Identity Authentication and Capability Based Access Control (IACAC) for the Internet of Things
Mahalle, P. N., Anggorojati, B., Prasad, N. R., & Prasad, R. (2013) · Journal of Cyber Security and Mobility · doi:10.13052/jcsm2245-1439.142 · Cited by 255
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
Bellare, M., Guérin, R., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_2 · Cited by 255
Self-citation
Metadata
- Authors
- Bellare, M., Kilian, J., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-09
- Pages
- 341-358
- OpenAlex
- W2122984309
- Cited by
- 394
- References
- 17
- FWCI
- 13.88
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.