The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3

DOI10.1007/978-3-662-53018-4_10zbMath1378.94023OpenAlexW2497610130MaRDI QIDQ2835590

Mihir Bellare, Björn Tackmann

Publication date: 30 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_10

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (19)

Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Efficient schemes for committing authenticated encryption ⋮ A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting ⋮ On committing authenticated-encryption ⋮ Authenticated encryption with key identification ⋮ Robust channels: handling unreliable networks in the record layers of QUIC and DTLS 1.3 ⋮ Luby-Rackoff backwards with more users and more security ⋮ ParaDiSE: efficient threshold authenticated encryption in fully malicious model ⋮ Authenticated confidential channel establishment and the security of TLS-DHE ⋮ A cryptographic analysis of the TLS 1.3 handshake protocol ⋮ The Multi-user Security of Double Encryption ⋮ On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments ⋮ Analysing the HPKE standard ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ Multi-user BBB security of public permutations based MAC ⋮ The memory-tightness of authenticated encryption ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Quantum generic attacks on key-alternating Feistel ciphers for shorter keys

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of a cipher from a single pseudorandom permutation.
• Public key signatures in the multi-user setting.
• Optimally Secure Block Ciphers from Ideal Primitives
• Hash-Function Based PRFs: AMAC and Its Multi-User Security
• Optimal Security Proofs for Signatures from Identification Schemes
• The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
• Breaking and Repairing GCM Security Proofs
• Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
• GCM Security Bounds Reconsidered
• The Software Performance of Authenticated-Encryption Modes
• Data Is a Stream: Security of Stream-Based Channels
• Multi-key Security: The Even-Mansour Construction Revisited
• Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer
• A Provable-Security Treatment of the Key-Wrap Problem
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Reconsidering Generic Composition
• Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Progress in Cryptology - INDOCRYPT 2004
• Optimistic Fair Exchange in a Multi-user Setting
• How to protect DES against exhaustive key search (an analysis of DESX).

This page was built for publication: The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3