On the Security of the CCM Encryption Mode and of a Slight Variant
Open accessIntegrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The KRACK key recovery and forgery attack applies only to TKIP and GCMP encryption schemes, not CCMP, which WPA2-PSK uses.
“This applies only to the TKIP and GCMP encryption schemes however.It has been shown that this cannot work with CCMP, which WPA2-PSK uses [6].”
From A Comprehensive Attack Flow Model and Security Analysis for Wi-Fi and WPA3 (2018) · cites this paper as [6]
Cites
Matsui, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45473-x · Cited by 1,422 · see citing works
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,360 · see citing works
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,123 · see citing works
Dolev, D., Dwork, C., & Naor, M. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103474 · Cited by 992 · see citing works
A concrete security treatment of symmetric encryption
Mihir Bellare, Y., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 932 · see citing works
Authenticated 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 881 · see citing works
Advances in Cryptology – EUROCRYPT 2016
Fischlin, M., & Coron, J.-S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5 · Cited by 834 · see citing works
Sequences of games: a tool for taming complexity in security proofs.
Shoup, V. (2004) · Cited by 750 · see citing works
Advances in Cryptology – CRYPTO 2005
(2005) · Lecture notes in computer science · doi:10.1007/11535218 · Cited by 725 · see citing works
Advances in Cryptology – CRYPTO 2004
(2004) · Lecture notes in computer science · doi:10.1007/b99099 · Cited by 704 · see citing works
Advances in Cryptology -- CRYPTO 2015
Gennaro, R., & Robshaw, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48000-7 · Cited by 661 · see citing works
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 653 · see citing works
Advances in Cryptology – EUROCRYPT 2022
(2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3 · Cited by 606 · see citing works
Advances in Cryptology – ASIACRYPT 2020
(2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64840-4 · Cited by 445 · see citing works
The 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 395 · see citing works
Advances in Cryptology – CRYPTO 2016
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3 · Cited by 374 · see citing works
Rogaway, P., Mihir Bellare, Y., Black, J., et al. (2001) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/501983.502011 · Cited by 368 · see citing works
New Proofs for NMAC and HMAC: Security Without Collision-Resistance
Mihir Bellare, Y. (2006) · Lecture notes in computer science · doi:10.1007/11818175_36 · Cited by 348 · see citing works
Recommendation for block cipher modes of operation :
Dworkin, M. J. (2007) · doi:10.6028/nist.sp.800-38c · Cited by 307 · see citing works
Bellare, M., Rogaway, P., & Wagner, D. A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25937-4_25 · Cited by 263 · see citing works
Encryption 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 · see citing works
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes
Dodis, Y., Gennaro, R., Håstad, J., Krawczyk, H., & Rabin, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28628-8_30 · Cited by 175 · see citing works
The Power of Verification Queries in Message Authentication and Authenticated Encryption.
Bellare, M., Goldreich, O., & Mityagin, A. (2004) · Cited by 102 · see citing works
Improved Security Analyses for CBC MACs
Bellare, M., Pietrzak, K., & Rogaway, P. (2005) · Lecture notes in computer science · doi:10.1007/11535218_32 · Cited by 98 · see citing works
The Sum of PRPs Is a Secure PRF
Lucks, S. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_34 · Cited by 97 · see citing works
Hall, C., Wagner, D. A., Kelsey, J. M., et al. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055742 · Cited by 90 · see citing works
On the Security of CTR + CBC-MAC
Jönsson, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36492-7_7 · Cited by 76 · see citing works
Bellare, M., & Impagliazzo, R. (1999) · IACR Cryptology ePrint Archive · Cited by 71 · see citing works
Characterization of Security Notions for Probabilistic Private-Key Encryption
Katz, J. I., & Yung, M. M. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0310-8 · Cited by 68 · see citing works
A Critique of CCM.Preprint
Rogaway, P., & Wagner, D. A. (2003) · IACR Cryptology ePrint Archive · Cited by 28 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2
Vanhoef, M., & Piessens, F. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134027 · Cited by 380 · see citing works
A Comprehensive Attack Flow Model and Security Analysis for Wi-Fi and WPA3
Kohlios, C. P., & Hayajneh, T. (2018) · Electronics · doi:10.3390/electronics7110284 · Cited by 77 · see citing works
“It has been shown that this cannot work with CCMP, which 442 WPA2-PSK uses [5].”
Background
- Authors
- Fouque, P.-A., Martinet, G., Valette, F., & Zimmer, S.
- Affiliations
- École Normale Supérieure - PSL (FR)
- Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR)
- ORCID
- Fouque, Pierre-Alain
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Volume
- 5037
- Pages
- 411-428
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1864901766
- Cited by
- 20
- References
- 30
- Citations by year
- 2025: 1 · 2023: 1 · 2022: 1 · 2020: 1 · 2019: 1 · 2018: 3 · 2017: 3 · 2016: 1 · 2015: 4 · 2014: 1 · 2012: 1
- FWCI
- 0.50
- Type
- conference paper
- Language
- en
- Open access
- green
- inria.hal.science
- Licence
- other-oa
- www.springer.com/tdm (tdm)
- Locations
- Lecture notes in computer science (publishedVersion)
- HAL (submittedVersion, other-oa)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Keywords
- authenticated encryption, CBC-MAC, counter mode, birthday paradox, privacy, associated data, generic attacks, pseudorandom functions
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
