The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
OCB: a block-cipher mode of operation for efficient authenticated encryption
Abstract
We describe a parallelizable block-cipher mode of operation that simultaneously provides privacy and authenticity. OCB encrypts-and-authenticates a nonempty string M ε {0,1}• using \lceil |M|/n\rceil + 2 block-cipher invocations, where n is the block length of the underlying block cipher. Additional overhead is small. OCB refines a scheme, IAPM, suggested by Charanjit Jutla. Desirable properties of OCB include: the ability to encrypt a bit string of arbitrary length into a ciphertext of minimal length; cheap offset calculations; cheap session setup; a single underlying cryptographic key; no extended-precision addition; a nearly optimal number of block-cipher calls; and no requirement for a random IV. We prove OCB secure, quantifying the adversary's ability to violate the mode's privacy or authenticity in terms of the quality of its block cipher as a pseudorandom permutation (PRP) or as a strong PRP, respectively.
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Kerberos: An Authentication Service for Open Network Systems
Steiner, J. G., Athena, Neuman, C., & Schiller, J. I. (1988) · Cited by 1,014
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
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-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-citationRelations 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
Self-citationDolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9026-x · Cited by 652
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-citationAuthenticated-encryption with associated-data
Rogaway, P. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586125 · Cited by 467
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
Security Flaws Induced by CBC Padding — Applications to SSL, IPSEC, WTLS...
Vaudenay, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_35 · Cited by 321
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-citationEncryption Modes with Almost Free Message Integrity
Jutla, C. S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_32 · Cited by 253
Cryptography: A new dimension in computer data security
Bookstein, A. (1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90072-x · Cited by 213
Bellare, M., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_24 · Cited by 197
Self-citationUnforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
Katz, J. I., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_20 · Cited by 182
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
Gligor, V. D., & Donescu, P. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x_8 · Cited by 163
Manger, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_14 · Cited by 128
Meyer, C. H., & Matyas, S. M. (1982) · International Linear Collider · Cited by 63
Cited by
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586117 · Cited by 3,541
Authenticated 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-citationAuthenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9026-x · Cited by 652
Self-citationMessage-Locked Encryption and Secure Deduplication
Bellare, M., Keelveedhi, S., & Ristenpart, T. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_18 · Cited by 632
Self-citationOn the Security of Joint Signature and Encryption
An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_6 · Cited by 571
Metadata
- Authors
- Rogaway, P., Bellare, M., Black, J., & Krovetz, T.
- Venue
- Proceedings of the 8th ACM conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2001-11-05
- Pages
- 196-205
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2145227448
- Cited by
- 368
- References
- 21
- FWCI
- 14.07
- Type
- conference paper
- Language
- en
- Open access
- closed
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.