Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
From MaRDI portal
Publication:1648810
DOI10.1007/978-3-319-78381-9_18zbMATH Open1423.94055OpenAlexW2794569840MaRDI QIDQ1648810FDOQ1648810
Authors: Priyanka Bose, Viet Tung Hoang, Stefano Tessaro 
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_18
Recommendations
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- Analyzing multi-key security degradation
- The Multi-user Security of Double Encryption
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
Cites Work
- New hash functions and their use in authentication and set equality
- Title not available (Why is that?)
- Tight security bounds for key-alternating ciphers
- Progress in Cryptology - INDOCRYPT 2004
- Title not available (Why is that?)
- A Provable-Security Treatment of the Key-Wrap Problem
- The “Coefficients H” Technique
- Space bounds for a game on graphs
- Reconsidering generic composition
- Multi-key security: the Even-Mansour construction revisited
- The Multi-user Security of Double Encryption
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Optimally secure block ciphers from ideal primitives
- 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.
- Title not available (Why is that?)
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- The sum of PRPs is a secure PRF
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- Title not available (Why is that?)
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
Cited In (20)
- Luby-Rackoff backwards with more users and more security
- Improved multi-user security using the squared-ratio method
- When messages are keys: is HMAC a dual-PRF?
- Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks
- The Security and Performance of “GCM” when Short Multiplications Are Used Instead
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Analyzing multi-key security degradation
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- Security under message-derived keys: signcryption in iMessage
- The multi-user security of MACs via universal hashing in the ideal cipher model
- Succinctly-committing authenticated encryption
- On the adaptive security of MACs and PRFs
- Multi-user BBB security of public permutations based MAC
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more
- Better concrete security for half-gates garbling (in the multi-instance setting)
- The summation-truncation hybrid: reusing discarded bits for free
- Efficient schemes for committing authenticated encryption
- Multi-user security of the sum of truncated random permutations
This page was built for publication: Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648810)
