Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
type: Item
instance of: scholarly article
title: Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
zbMATH Open document ID: 1423.94055
DOI: 10.1007/978-3-319-78381-9_18
author: Priyanka Bose
author: Viet Tung Hoang
author: Stefano Tessaro
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6900688
zbMATH Keywords: multi-user security
zbMATH Keywords: AES-GCM-SIV
zbMATH Keywords: authenticated encryption
zbMATH Keywords: concrete security
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 18
OpenAlex ID: W2794569840
cites work: Q2707452
cites work: Hash-Function Based PRFs: AMAC and Its Multi-User Security
cites work: Q3374913
cites work: Q4249643
cites work: The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
cites work: How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
cites work: Tight Security Bounds for Key-Alternating Ciphers
cites work: Information-theoretic indistinguishability via the chi-squared method
cites work: How many queries are needed to distinguish a truncated random permutation from a random function?
cites work: Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
cites work: The Multi-user Security of Double Encryption
cites work: New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
cites work: Q3374930
cites work: Analyzing multi-key security degradation
cites work: Q4737239
cites work: Progress in Cryptology - INDOCRYPT 2004
cites work: Multi-key Security: The Even-Mansour Construction Revisited
cites work: Reconsidering Generic Composition
cites work: A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
cites work: The “Coefficients H” Technique
cites work: A Provable-Security Treatment of the Key-Wrap Problem
cites work: Optimally Secure Block Ciphers from Ideal Primitives
cites work: New hash functions and their use in authentication and set equality
cites work: Space bounds for a game on graphs
description: scientific article; zbMATH DE number 6900688