Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
By Phillip Rogaway. International Conference on the Theory and Application of Cryptology and Information Security, 2004
503 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/3d6fd5526ed5247a5907caa76cc2151318fa5b4d
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
- Ted Krovetz
- Phillip Rogaway
- Ari Juels
- R. Rivest
- David A. Wagner
- B. Kaliski
- Moses D. Liskov
- Mihir Bellare
In Computer Vision and Pattern Recognition
- Ted Krovetz
- Phillip Rogaway
- Ari Juels
- B. Kaliski
- David A. Wagner
- Moses D. Liskov
- R. Rivest
- Nicholas Carlini
Citations in the corpus
- Tweakable Block Ciphers (2002, methodology): “Indeed, Rogaway revisited OCB mode in his Asiacrypt 2004 paper [32].”
- Pors: proofs of retrievability for large files (2007, methodology): “In this case, we require indistinguishability under a chosen-plaintext attack; it would be undesirable, for example, if an adversary in a position to in.uence F were able to distinguish the data contents of blocks.2 In practice, an appropriate choice of cipher E wouldbeatweakable blockcipher [2”
- The Software Performance of Authenticated-Encryption Modes (2011, methodology): “…— ✓ GCM [31] 2004 C CTR encryption + GF(2 128 )-based CW MAC NIST 800-38D EAX [2] 2004 C CTR encryption + CMAC, a cleaned-up CCM ISO 19772 ✓ OCB2 [34] 2004 I OCB1 with AD and alleged speed improvements ISO 19772 CCFB [29] 2005 I Similar to RPC [23], but with chaining — CHM [18] 2006 C…”