The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Tweakable Block Ciphers
Open accessOverview
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.
Integrity signals
Registry
Cites
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.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Self-citationApplied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C
Schneier, B. (2015) · Wiley eBooks · doi:10.1002/9781119183471 · Cited by 504
New types of cryptanalytic attacks using related keys
Biham, E. (1994) · Journal of Cryptology · doi:10.1007/bf00203965 · Cited by 473
UMAC: Fast and Secure Message Authentication
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., & Rogaway, P. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_14 · Cited by 390
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
A construction of a cipher from a single pseudorandom permutation
Even, S., & Mansour, Y. (1997) · Journal of Cryptology · doi:10.1007/s001459900025 · Cited by 351
On Fast and Provably Secure Message Authentication Based on Universal Hashing
Shoup, V. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_24 · Cited by 211
How to Protect DES Against Exhaustive Key Search
Kilian, J., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_20 · Cited by 187
Provable security for block ciphers by decorrelation
Serge Vaudenay, B. (1998) · Lecture notes in computer science · doi:10.1007/bfb0028566 · Cited by 108
Limitations of the Even-Mansour construction
Daemen, J. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1_46 · Cited by 104
How to strengthen DES using existing hardware
Biham, E., & Biryukov, A. (1995) · Lecture notes in computer science · doi:10.1007/bfb0000451 · Cited by 42
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
A 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
Bellare, M., Ristenpart, T., Rogaway, P., & Stegers, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-05445-7_19 · Cited by 274
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
Metadata
- Authors
- Liskov, M., Rivest, R. L., & Wagner, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 31-46
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1655844021
- Cited by
- 468
- References
- 12
- FWCI
- 8.16
- Type
- conference paper
- Language
- en
- Open access
- green
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.
