Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds

DOI10.1007/978-3-319-78381-9_18zbMath1423.94055OpenAlexW2794569840MaRDI QIDQ1648810

Viet Tung Hoang, Stefano Tessaro, Priyanka Bose

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_18

zbMATH Keywords

authenticated encryptionconcrete securitymulti-user securityAES-GCM-SIV

Mathematics Subject Classification ID

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

Related Items (14)

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 ⋮ Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks ⋮ Multi-user security of the sum of truncated random permutations ⋮ Improved multi-user security using the squared-ratio method ⋮ When messages are keys: is HMAC a dual-PRF? ⋮ Luby-Rackoff backwards with more users and more security ⋮ Toward a fully secure authenticated encryption scheme from a pseudorandom permutation ⋮ On the adaptive security of MACs and PRFs ⋮ Security under message-derived keys: signcryption in iMessage ⋮ Multi-user BBB security of public permutations based MAC ⋮ The summation-truncation hybrid: reusing discarded bits for free ⋮ Better concrete security for half-gates garbling (in the multi-instance setting)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hash functions and their use in authentication and set equality
• Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
• Information-theoretic indistinguishability via the chi-squared method
• Analyzing multi-key security degradation
• How many queries are needed to distinguish a truncated random permutation from a random function?
• How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
• Optimally Secure Block Ciphers from Ideal Primitives
• Hash-Function Based PRFs: AMAC and Its Multi-User Security
• Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
• The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
• Multi-key Security: The Even-Mansour Construction Revisited
• A Provable-Security Treatment of the Key-Wrap Problem
• New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
• The “Coefficients H” Technique
• Space bounds for a game on graphs
• Reconsidering Generic Composition
• Tight Security Bounds for Key-Alternating Ciphers
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Progress in Cryptology - INDOCRYPT 2004
• The Multi-user Security of Double Encryption

This page was built for publication: Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds