The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
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
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825 · cited 1×
“This and subsequent discrete logs were computed using a Maple-implementation combining the Pohlig-Hellman [12] and Pollard-rho [ 13 ] algorithms.”
MethodThe 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-citationLiskov, M., Rivest, R. L., & Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_3 · Cited by 468
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-citationOCB: 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-citationMonte Carlo Methods for Index Computation (mod p)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.2307/2006496 · Cited by 367
Whiting, D., Housley, R., & Ferguson, N. (2003) · doi:10.17487/rfc3610 · Cited by 329
OCB: A block-cipher mode of operation for efficient authenticated encryption
Rogaway, P., Bellare, M., & Black, J. (2003) · ACM Transactions on Information and System Security · doi:10.1145/937527.937529 · Cited by 322
Self-citationA Block-Cipher Mode of Operation for Parallelizable Message Authentication
Black, J., & Rogaway, P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_25 · Cited by 274
Self-citationBellare, M., Rogaway, P., & Wagner, D. A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25937-4_25 · Cited by 263
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
A Parallelizable Enciphering Mode
Halevi, S., & Rogaway, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24660-2_23 · Cited by 220
Self-citationFast 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
How to Protect DES Against Exhaustive Key Search (an Analysis of DESX)
Kilian, J., & Rogaway, P. (2001) · Journal of Cryptology · doi:10.1007/s001450010015 · Cited by 148
Self-citation
Cited by
Pors: proofs of retrievability for large files
Juels, A., & Kaliski, B. S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315317 · Cited by 1,894
Lest we remember: cold-boot attacks on encryption keys
Halderman, J. A., Schoen, S. D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J. A., Feldman, A. J., Appelbaum, J., & Felten, E. W. (2009) · Communications of the ACM · doi:10.1145/1506409.1506429 · Cited by 980
Breaking Symmetric Cryptosystems Using Quantum Period Finding
Kaplan, M., Leurent, G., Leverrier, A., & Naya-Plasencia, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53008-5_8 · Cited by 336
The Software Performance of Authenticated-Encryption Modes
Krovetz, T., & Rogaway, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21702-9_18 · Cited by 262
Self-citation
Metadata
- Authors
- Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 16-31
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2155115217
- Cited by
- 410
- References
- 17
- FWCI
- 4.34
- 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.