The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Tweakable Block Ciphers
Open accessAbstract
A common trend in applications of block ciphers over the past decades has been to employ block ciphers as one piece of a “mode of operation”—possibly, a way to make a secure symmetric-key cryptosystem, but more generally, any cryptographic application. Most of the time, these modes of operation use a wide variety of techniques to achieve a subgoal necessary for their main goal: instantiation of “essentially different” instances of the block cipher. We formalize a cryptographic primitive, the “ tweakable block cipher .” Such a cipher has not only the usual inputs—message and cryptographic key—but also a third input, the “tweak.” The tweak serves much the same purpose that an initialization vector does for CBC mode or that a nonce does for OCB mode. Our abstraction brings this feature down to the primitive block-cipher level, instead of incorporating it only at the higher modes-of-operation levels. We suggest that (1) tweakable block ciphers are easy to design, (2) the extra cost of making a block cipher “tweakable” is small, and (3) it is easier to design and prove the security of applications of block ciphers that need this variability using tweakable block ciphers.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Self-citation
Cited by
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_7 · Cited by 1,395
Compact Proofs of Retrievability
Shacham, H., & Waters, B. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9129-2 · Cited by 511
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
Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
Hoang, V. T., Reyhanitabar, R., Rogaway, P., & Vizár, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-47989-6_24 · Cited by 57
Metadata
- Authors
- Liskov, M., Rivest, R. L., & Wagner, D.
- Venue
- Journal of Cryptology
- Published
- 2010-09-02
- Volume
- 24
- Issue
- 3
- Pages
- 588-613
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2126290606
- Cited by
- 196
- References
- 1
- FWCI
- 6.80
- Type
- journal article
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tweakable Block Ciphers. https://app.cochat.ai/papers/10.1007/s00145-010-9073-y
- The paper
- Liskov, M., Rivest, R. L., & Wagner, D. (2011). Tweakable Block Ciphers. Journal of Cryptology. https://doi.org/10.1007/s00145-010-9073-y
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.