Key-alternating ciphers and key-length extension: exact bounds and multi-user security
From MaRDI portal
Publication:2835581
DOI10.1007/978-3-662-53018-4_1zbMATH Open1351.94051OpenAlexW2477309039MaRDI QIDQ2835581FDOQ2835581
Authors: Viet Tung Hoang, Stefano Tessaro 
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_1
Recommendations
- Tight security bounds for key-alternating ciphers
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Relaxing full-codebook security: a refined analysis of key-length extension schemes
- Plain versus randomized cascading-based key-length extension for block ciphers
- Tight security for key-alternating ciphers with correlated sub-keys
Cites Work
- A construction of a cipher from a single pseudorandom permutation.
- On the indifferentiability of key-alternating ciphers
- Minimizing the two-round Even-Mansour cipher
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Title not available (Why is that?)
- Tight security bounds for key-alternating ciphers
- Title not available (Why is that?)
- Title not available (Why is that?)
- An asymptotically tight security analysis of the iterated Even-Mansour cipher
- Minimalism in cryptography: the Even-Mansour scheme revisited
- The “Coefficients H” Technique
- A Simple and Unified Method of Proving Indistinguishability
- Format-preserving encryption
- Multi-key security: the Even-Mansour construction revisited
- The security of multiple encryption in the ideal cipher model
- How to stretch random functions: The security of protected counter sums
- Plain versus randomized cascading-based key-length extension for block ciphers
- Efficient and optimally secure key-length extension for block ciphers via randomized cascading
- Relaxing full-codebook security: a refined analysis of key-length extension schemes
- Cascade Encryption Revisited
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
- Optimally secure block ciphers from ideal primitives
- How to Protect DES Against Exhaustive Key Search
Cited In (56)
- The exact multi-user security of 2-key triple DES
- The multi-user security of MACs via universal hashing in the ideal cipher model
- The exact multi-user security of (tweakable) key alternating ciphers with a single permutation
- Tight security of \textsf{TNT} and beyond. Attacks, proofs and possibilities for the cascaded \textsf{LRW} paradigm
- Information-theoretic security with asymmetries
- Random oracles and non-uniformity
- Fine-tuning the ISO/IEC standard \textsf{LightMAC}
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- The Multi-user Security of Double Encryption
- Improved multi-user security using the squared-ratio method
- Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Tight security of cascaded LRW2
- On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks
- Security proofs for key-alternating ciphers with non-independent round permutations
- Revisiting the security of \textsf{COMET} authenticated encryption scheme
- Full-state keyed duplex with built-in multi-user support
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- Efficient and optimally secure key-length extension for block ciphers via randomized cascading
- Plain versus randomized cascading-based key-length extension for block ciphers
- Relaxing full-codebook security: a refined analysis of key-length extension schemes
- A forkcipher-based pseudo-random number generator
- The \(t\)-wise independence of substitution-permutation networks
- XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation
- Toward a fully secure authenticated encryption scheme from a pseudorandom permutation
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
- Offset-based BBB-secure tweakable block-ciphers with updatable caches
- Connecting tweakable and multi-key blockcipher security
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- Towards closing the security gap of Tweak-aNd-Tweak (TNT)
- ZLR: a fast online authenticated encryption scheme achieving full security
- A sponge-based PRF with good multi-user security
- Tweaking key-alternating Feistel block ciphers
- A modular approach to the security analysis of two-permutation constructions
- Provably secure reflection ciphers
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Tight security analysis of 3-round key-alternating cipher with a single permutation
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Revisiting BBS signatures
- Categorization of faulty nonce misuse resistant message authentication
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- Tight security for key-alternating ciphers with correlated sub-keys
- Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
- Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
- On the adaptive security of MACs and PRFs
- BBB secure nonce based MAC using public permutations
- Salvaging weak security bounds for blockcipher-based constructions
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
- 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)
- Security analysis of NIST CTR-DRBG
- Key-reduced variants of 3Kf9 with beyond-birthday-bound security
- Multi-user security of the sum of truncated random permutations
This page was built for publication: Key-alternating ciphers and key-length extension: exact bounds and multi-user security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835581)
