Tight Security Bounds for Key-Alternating Ciphers
From MaRDI portal
Publication:5418704
DOI10.1007/978-3-642-55220-5_19zbMath1317.94096OpenAlexW2134553300MaRDI QIDQ5418704
Shan Chen, John P. Steinberger
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_19
Related Items
How to build an ideal cipher: the indifferentiability of the Feistel construction, Related-key analysis of generalized Feistel networks with expanding round functions, The key-dependent message security of key-alternating Feistel ciphers, Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting, On the resilience of Even-Mansour to invariant permutations, Towards tight security of cascaded LRW2, The \(t\)-wise independence of substitution-permutation networks, Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour, Tweaking Even-Mansour Ciphers, Multi-key Security: The Even-Mansour Construction Revisited, The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC, Key recovery attacks on iterated Even-Mansour encryption schemes, Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds, Beyond-birthday security for permutation-based Feistel networks, Connecting tweakable and multi-key blockcipher security, \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations, Beyond-birthday secure domain-preserving PRFs from a single permutation, Partition and mix: generalizing the swap-or-not shuffle, Keyed sum of permutations: a simpler RP-based PRF, Multi-user security bound for filter permutators in the random oracle model, Revisiting BBS signatures, Block-cipher-based tree hashing, Adaptively code-correlation robustness functions and its applications to private set intersection, Salvaging Weak Security Bounds for Blockcipher-Based Constructions, How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers, Key-reduced variants of 3Kf9 with beyond-birthday-bound security, Jammin' on the deck, A modular approach to the security analysis of two-permutation constructions, Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers, BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers, Better security-efficiency trade-offs in permutation-based two-party computation, Tight security for key-alternating ciphers with correlated sub-keys, Fine-tuning the ISO/IEC standard \textsf{LightMAC}, Categorization of faulty nonce misuse resistant message authentication, \textsf{tHyENA}: making \textsf{HyENA} even smaller, Provably secure reflection ciphers, Designing tweakable enciphering schemes using public permutations, Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules), Offset-based BBB-secure tweakable block-ciphers with updatable caches, Provable security against generic attacks on stream ciphers, Half-tree: halving the cost of tree expansion in COT and DPF, Output masking of tweakable Even-Mansour can be eliminated for message authentication code, A robust and sponge-like PRNG with improved efficiency, Minimizing the two-round tweakable Even-Mansour cipher, Tight security analysis of 3-round key-alternating cipher with a single permutation, How to build optimally secure PRFs using block ciphers, Tweaking key-alternating Feistel block ciphers, New Bounds for Keyed Sponges with Extendable Output: Independence Between Capacity and Message Length, Strengthening the Known-Key Security Notion for Block Ciphers, Key alternating ciphers based on involutions, On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks, Minimizing the two-round Even-Mansour cipher, The Multi-user Security of Double Encryption, Slidex attacks on the Even-Mansour encryption scheme, On the XOR of Multiple Random Permutations, The Oribatida v1.3 family of lightweight authenticated encryption schemes, Analysis of the single-permutation encrypted Davies-Meyer construction, Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model, The Counter mode with encrypted nonces and its extension to authenticated encryption, Compactness of hashing modes and efficiency beyond Merkle tree, Provable related-key security of contracting Feistel networks, Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security, Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers, XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees, Indifferentiability of 8-Round Feistel Networks, EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC, Security analysis of NIST CTR-DRBG, Better concrete security for half-gates garbling (in the multi-instance setting)
