Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 322

The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.

OCB: A block-cipher mode of operation for efficient authenticated encryption

Rogaway, Phillip, Bellare, Mihir, Black, John·2003·ACM Transactions on Information and System Security

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 ⌈| M |/ n ⌉ + 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 key 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/937527.937529

Cites

24 of 24 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 24 references

Research works printed but not linked: 15

  1. An , J. and Bellare , M . 2001. Does encryption with redundancy provide authenticity? In Advances in Cryptology---EUROCRYPT 2001. B. Pfitzmann , Ed. Lecture Notes in Computer Science , vol. 2045 . Springer-Verlag, Berlin, 512--528. See also www-cse.ucsd.edu/users/mihir.]] An, J. and Bellare, M. 2001. Does encryption with redundancy provide authenticity? In Advances in Cryptology---EUROCRYPT 2001. B. Pfitzmann, Ed. Lecture Notes in Computer Science, vol. 2045. Springer-Verlag, Berlin, 512--528. See also www-cse.ucsd.edu/users/mihir.]]
  2. Aoki , K. and Lipmaa , H . 2000. Fast implementations of AES candidates . In The 3rd Advanced Encryption Standard Candidate Conference. National Institute of Standards and Technology , New York, NY, USA, 106--120. See www.tml.hut.fi/∼helger.]] Aoki, K. and Lipmaa, H. 2000. Fast implementations of AES candidates. In The 3rd Advanced Encryption Standard Candidate Conference. National Institute of Standards and Technology, New York, NY, USA, 106--120. See www.tml.hut.fi/∼helger.]]
  3. Black , J. and Urtubia , H . 2002. Side-channel attacks on symmetric encryption schemes: The case for authenticated encryption . In Proceedings of the 11th USENIX Security Symposium. USENIX, 327--338 . See www.cs.colorado.edu/∼jrblack/.]] Black, J. and Urtubia, H. 2002. Side-channel attacks on symmetric encryption schemes: The case for authenticated encryption. In Proceedings of the 11th USENIX Security Symposium. USENIX, 327--338. See www.cs.colorado.edu/∼jrblack/.]]
  4. Gligor , V. and Donescu , P . 2000b. Fast encryption and authentication: XCBC encryption and XECB authentication modes. Contribution to NIST , Oct 27, 2000. See csrc.nist.gov/encryption/aes/modes.]] Gligor, V. and Donescu, P. 2000b. Fast encryption and authentication: XCBC encryption and XECB authentication modes. Contribution to NIST, Oct 27, 2000. See csrc.nist.gov/encryption/aes/modes.]]
  5. Gligor , V. and Donescu , P . 2002. Fast encryption and authentication: XCBC encryption and XECB authentication modes. In Fast Software Encryption , 8th International Workshop, FSE 2001 . M. Matsui, Ed. Lecture Notes in Computer Science , vol. 2355 . Springer-Verlag, Berlin, 92--108. See www.ece.umd.edu/∼gligor/.]] Gligor, V. and Donescu, P. 2002. Fast encryption and authentication: XCBC encryption and XECB authentication modes. In Fast Software Encryption, 8th International Workshop, FSE 2001. M. Matsui, Ed. Lecture Notes in Computer Science, vol. 2355. Springer-Verlag, Berlin, 92--108. See www.ece.umd.edu/∼gligor/.]]
  6. Halevi , S. 2001 . An observation regarding Jutla's modes of operation. Cryptology ePrint archive, reference number 2001/015 , submitted Feb. 22 , 2001, revised Apr. 2, 2001. See eprint.iacr.org.]] Halevi, S. 2001. An observation regarding Jutla's modes of operation. Cryptology ePrint archive, reference number 2001/015, submitted Feb. 22, 2001, revised Apr. 2, 2001. See eprint.iacr.org.]]
  7. Jutla , C. 2000a. Encryption modes with almost free message integrity. Cryptology ePrint archive, reference number 2000/039 , Aug. 1 , 2000 . See eprint.iacr.org.]] Jutla, C. 2000a. Encryption modes with almost free message integrity. Cryptology ePrint archive, reference number 2000/039, Aug. 1, 2000. See eprint.iacr.org.]]
  8. Jutla , C. 2000b. Encryption modes with almost free message integrity. Contribution to NIST. Undated manuscript, appearing Oct. 2000 at csrc.nist.gov/encryption/modes/workshop1.]] Jutla, C. 2000b. Encryption modes with almost free message integrity. Contribution to NIST. Undated manuscript, appearing Oct. 2000 at csrc.nist.gov/encryption/modes/workshop1.]]
  9. Jutla , C. 2001a. Encryption modes with almost free message integrity . In Advances in Cryptology---EUROCRYPT 2001 . B. Pfitzmann, Ed . Lecture Notes in Computer Science, vol. 2045 . Springer-Verlag , Berlin.]] Jutla, C. 2001a. Encryption modes with almost free message integrity. In Advances in Cryptology---EUROCRYPT 2001. B. Pfitzmann, Ed. Lecture Notes in Computer Science, vol. 2045. Springer-Verlag, Berlin.]]
  10. Jutla , C. 2001b. Encryption modes with almost free message integrity. Contribution to NIST. Undated manuscript, posted May 24, 2001 at NIST web site csrc.nist.gov/encryption/modes/proposedmodes.]] Jutla, C. 2001b. Encryption modes with almost free message integrity. Contribution to NIST. Undated manuscript, posted May 24, 2001 at NIST web site csrc.nist.gov/encryption/modes/proposedmodes.]]
  11. Katz , J. and Yung , M . 2000a. Complete characterization of security notions for probabilistic private-key encryption . In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000 ). ACM Press, New York, 245--254.]] 10.1145/335305.335335 Katz, J. and Yung, M. 2000a. Complete characterization of security notions for probabilistic private-key encryption. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000). ACM Press, New York, 245--254.]] 10.1145/335305.335335 · doi:10.1145/335305.335335
  12. Katz , J. and Yung , M . 2000b. Unforgeable encryption and adaptively secure modes of operation. In Fast Software Encryption , 7th International Workshop, FSE 2000 . B. Schneier, Ed. Lecture Notes in Computer Science , vol. 1978 . Springer-Verlag, Berlin, 284--299.]] Katz, J. and Yung, M. 2000b. Unforgeable encryption and adaptively secure modes of operation. In Fast Software Encryption, 7th International Workshop, FSE 2000. B. Schneier, Ed. Lecture Notes in Computer Science, vol. 1978. Springer-Verlag, Berlin, 284--299.]]
  13. Preneel , B. 1998. Cryptographic primitives for information authentication---State of the art . In State of the Art in Applied Cryptography, COSIC '97 . Lecture Notes in Computer Science , vol. 1528 . Springer-Verlag , Berlin , 49--104.]] Preneel, B. 1998. Cryptographic primitives for information authentication---State of the art. In State of the Art in Applied Cryptography, COSIC '97. Lecture Notes in Computer Science, vol. 1528. Springer-Verlag, Berlin, 49--104.]]
  14. Rogaway , P. 2000 . OCB mode: Parallelizable authenticated encryption. Contribution to NIST , Oct. 16, 2000 (Preliminary version of the OCB algorithm). See csrc.nist.gov/encryption/ modes/workshop1.]] Rogaway, P. 2000. OCB mode: Parallelizable authenticated encryption. Contribution to NIST, Oct. 16, 2000 (Preliminary version of the OCB algorithm). See csrc.nist.gov/encryption/ modes/workshop1.]]
  15. RSA Laboratories . 1998. PKCS #1 : RSA encryption standard , Version 1.5, PKCS #1: RSA cryptography specifications, Version 2.0 , Sep. 1998 , B. Kaliski and J. Staddon. See www.rsasecurity. com/rsalabs/pkcs/pkcs-1.]] RSA Laboratories. 1998. PKCS #1: RSA encryption standard, Version 1.5, PKCS #1: RSA cryptography specifications, Version 2.0, Sep. 1998, B. Kaliski and J. Staddon. See www.rsasecurity. com/rsalabs/pkcs/pkcs-1.]]

Cited by

See all 322

Metadata

Authors
Rogaway, P., Bellare, M., & Black, J.
Venue
ACM Transactions on Information and System Security
Published
2003-08
Volume
6
Issue
3
Pages
365-403
ISSN
  • 1094-9224 (ISSN-L)
  • 1557-7406
OpenAlex
W1990395488
Cited by
322
References
24
FWCI
8.13
Type
journal article
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: OCB: A block-cipher mode of operation for efficient authenticated encryption. https://app.cochat.ai/papers/10.1145/937527.937529
The paper
Rogaway, P., Bellare, M., & Black, J. (2003). OCB: A block-cipher mode of operation for efficient authenticated encryption. ACM Transactions on Information and System Security. https://doi.org/10.1145/937527.937529

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.