Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
From MaRDI portal
(Redirected from Publication:1648810)
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
- scientific article; zbMATH DE number 1583805 (Why is no real title available?)
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- A Provable-Security Treatment of the Key-Wrap Problem
- Analyzing multi-key security degradation
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- 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.
- Information-theoretic indistinguishability via the chi-squared method
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Multi-key security: the Even-Mansour construction revisited
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- New hash functions and their use in authentication and set equality
- Optimally secure block ciphers from ideal primitives
- Progress in Cryptology - INDOCRYPT 2004
- Reconsidering generic composition
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Space bounds for a game on graphs
- The Multi-user Security of Double Encryption
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- The sum of PRPs is a secure PRF
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
Cited in
(20)- Efficient schemes for committing authenticated encryption
- Multi-user security of the sum of truncated random permutations
- 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
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
- 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
- Better concrete security for half-gates garbling (in the multi-instance setting)
- The summation-truncation hybrid: reusing discarded bits for free
- KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more
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)
