Breaking and repairing GCM security proofs

DOI10.1007/978-3-642-32009-5_3MaRDI QIDQ2914249zbMATH OpenOpenAlexWikidataFDO

Authors Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32009-5_3

zbMATH Keywords

counter-exampleGCMproof of securitydistinguishing attack

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• GCM security bounds reconsidered
• Authentication key recovery on Galois/counter mode (GCM)
• Progress in Cryptology - INDOCRYPT 2004
• On the security of AEAD-cryptosystem of the GCM type
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead

Cited in

(22)

• Cryptanalysis of OCB2: attacks on authenticity and confidentiality
• How fast can SM4 be in software?
• Robust channels: handling unreliable networks in the record layers of QUIC and DTLS 1.3
• Optimal forgeries against polynomial-based MACs and GCM
• On modes of operations of a block cipher for authentication and authenticated encryption
• Related-key almost universal hash functions: definitions, constructions and applications
• Beyond conventional security in sponge-based authenticated encryption modes
• The memory-tightness of authenticated encryption
• Keyed sum of permutations: a simpler RP-based PRF
• XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation
• The Missing Difference problem, and its applications to counter mode encryption
• GCM security bounds reconsidered
• Authentication key recovery on Galois/counter mode (GCM)
• The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
• Another look at XCB
• The committing security of MACs with applications to generic composition
• On weak keys and forgery attacks against polynomial-based MAC schemes
• On weak keys and forgery attacks against polynomial-based MAC schemes
• On the security of AEAD-cryptosystem of the GCM type
• Single-trace side-channel analysis on polynomial-based MAC schemes
• Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle
• The summation-truncation hybrid: reusing discarded bits for free

This page was built for publication: Breaking and repairing GCM security proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914249)