The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
A Provable-Security Treatment of the Key-Wrap Problem
Overview
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
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
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
A concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Self-citationAuthenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_41 · Cited by 879
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Self-citationRecommendation for block cipher modes of operation: methods and techniques
Dworkin, M. J. (2001) · doi:10.6028/nist.sp.800-38a · Cited by 746
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9026-x · Cited by 652
The 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-citationThe Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_19 · Cited by 393
The Galois/Counter Mode of Operation (GCM)
McGrew, D. A., & Viega, J. (2005) · Cited by 332
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-citationRecommendation for block cipher modes of operation: the CMAC mode for authentication
Dworkin, M. J. (2005) · doi:10.6028/nist.sp.800-38b-2005 · Cited by 314
Dworkin, M. J. (2007) · doi:10.6028/nist.sp.800-38c · Cited by 297
A 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-citationHalevi, S., & Rogaway, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_28 · Cited by 261
Self-citationNonce-Based Symmetric Encryption
Rogaway, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25937-4_22 · Cited by 253
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
Bellare, M., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_24 · Cited by 197
Self-citationUnforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
Katz, J. I., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_20 · Cited by 182
Code-Based Game-Playing Proofs and the Security of Triple Encryption
Mihir Bellare, Y., & Rogaway, P. (2006) · Cited by 161
Self-citationEntropic Security and the Encryption of High Entropy Messages
Dodis, Y., & Smith, A. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30576-7_30 · Cited by 113
Online Ciphers and the Hash-CBC Construction
Mihir Bellare, Y., Boldyreva, A., Knudsen, L. R., et al. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_18 · Cited by 72
About the Security of Ciphers (Semantic Security and Pseudo-Random Permutations)
Phan, D. H., & Pointcheval, D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30564-4_13 · Cited by 70
How to Fool an Unbounded Adversary with a Short Key
Russell, A. C., & Wang, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_9 · Cited by 38
Cited by
Order-Preserving Symmetric Encryption
Boldyreva, A., Chenette, N., Lee, Y., & O’Neill, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_13 · Cited by 887
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9026-x · Cited by 652
Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28496-0_19 · Cited by 356
Secure Hybrid Encryption from Weakened Key Encapsulation
Hofheinz, D., & Kiltz, E. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_31 · Cited by 306
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., & Shrimpton, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 373-390
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1855109561
- Cited by
- 383
- References
- 28
- FWCI
- 4.08
- 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.