A Block-Cipher Mode of Operation for Parallelizable Message Authentication
By John Black, Phillip Rogaway. International Conference on the Theory and Application of Cryptographic Techniques, 2002
312 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/895d259b9d47da096dda8da2bc3ad68538c2691f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Mihir Bellare
- David A. McGrew
- John Viega
- Chanathip Namprempre
- Phillip Rogaway
- Kaoru Kurosawa
- Tetsu Iwata
- Jonathan Katz
In Computer Vision and Pattern Recognition
- Mihir Bellare
- David A. McGrew
- John Viega
- Chanathip Namprempre
- Phillip Rogaway
- Tetsu Iwata
- Kaoru Kurosawa
- Eike Kiltz
Citations in the corpus
- OMAC: One-Key CBC MAC (2003, methodology): “(In OCB mode [13] and PMAC [5], L = EK(0n) is also used as a key of a universal hash function.”
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC (2004, methodology): “We do this by refining two highly-optimized modes, OCB [16] and PMAC [5], yielding two new modes, OCB1 and PMAC1.”
- Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm (2000, background): “There are many practical MACs that are SUF-CMA secure under standard assumptions, for example, HMAC [3,8], CBCMAC [11,15], EMAC [44], XCBC [18], PMAC [19], TMAC [41], OMAC [33], and CMAC [49].”
- The Security and Performance of the Galois/Counter Mode (GCM) of Operation (2004, methodology): “In OCB (Figure 1, bottom), the AES pipline is used in three distinct ways: to encrypt the IV, to encrypt the plaintext, and to compute the authentication tag.”
- Authenticated-encryption with associated-data (2002, methodology): “From [5, 22] and Theorem 2 we know right off that OC̈B = OCB ̈PMAC = (K̈, Ë , D̈) is secure.”