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
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.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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-citation(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6 · Cited by 779
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
The 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-citationChosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1
Bleichenbacher, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055716 · Cited by 590
Authenticated-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
OCB: a block-cipher mode of operation for efficient authenticated encryption
Rogaway, P., Bellare, M., Black, J., & Krovetz, T. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502011 · Cited by 368
Self-citationSecurity 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-citationCryptography: 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
Advances in Cryptology — CRYPTO '97
Kaliski, B. S. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052223 · Cited by 154
Weik, M. H. (2000) · Springer eBooks · doi:10.1007/1-4020-0613-6_13861 · Cited by 75
Dwork, C. (2006) · Lecture notes in computer science · doi:10.1007/11818175 · Cited by 7
Research works printed but not linked: 15
- 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.]]
- 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.]]
- 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/.]]
- 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.]]
- 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/.]]
- 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.]]
- 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.]]
- 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.]]
- 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.]]
- 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.]]
- 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
- 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.]]
- 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.]]
- 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.]]
- 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
FPGA Intrinsic PUFs and Their Use for IP Protection
Guajardo, J., Kumar, S. S., Schrijen, G.-J., & Tuyls, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_5 · Cited by 1,203
Scalable and efficient provable data possession
Ateniese, G., Di Pietro, R., Mancini, L. V., & Tsudik, G. (2008) · Proceedings of the 4th international conference on Security and privacy in communication netowrks · doi:10.1145/1460877.1460889 · Cited by 1,129
BSN-Care: A Secure IoT-Based Modern Healthcare System Using Body Sensor Network
Gope, P., & Hwang, T. (2016) · IEEE Sensors Journal · doi:10.1109/jsen.2015.2502401 · Cited by 714
Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
Rogaway, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30539-2_2 · Cited by 410
Self-citationA Provable-Security Treatment of the Key-Wrap Problem
Rogaway, P., & Shrimpton, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_23 · Cited by 383
Self-citation
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
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.