On the indifferentiability of key-alternating ciphers
From MaRDI portal
Publication:2845693
DOI10.1007/978-3-642-40041-4_29zbMATH Open1310.94124OpenAlexW2130574782MaRDI QIDQ2845693FDOQ2845693
John P. Steinberger, E. A. Andreeva, Yevgeniy Dodis, Bart Mennink, Andrey Bogdanov
Publication date: 2 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_29
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)
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- How to construct an ideal cipher from a small set of public permutations
- Minimizing the two-round Even-Mansour cipher
Cited In (36)
- Minimizing the two-round Even-Mansour cipher
- Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
- Public-Seed Pseudorandom Permutations
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Salvaging Weak Security Bounds for Blockcipher-Based Constructions
- On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks
- New slide attacks on almost self-similar ciphers
- Feistel ciphers based on a single primitive
- ON THE KEYSPACE OF THE HILL CIPHER
- The relationship between idealized models under computationally bounded adversaries
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- Key recovery attacks on iterated Even-Mansour encryption schemes
- The \(t\)-wise independence of substitution-permutation networks
- Sequential indifferentiability of confusion-diffusion networks
- Connecting tweakable and multi-key blockcipher security
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- Indifferentiability of 8-Round Feistel Networks
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- From Indifferentiability to Constructive Cryptography (and Back)
- XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees
- Improved domain extender for the ideal cipher
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- KHAPE: Asymmetric PAKE from key-hiding key exchange
- Provable security against generic attacks on stream ciphers
- Asymmetric PAKE with low computation \textit{and} communication
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Tweaking Even-Mansour Ciphers
- Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes
- On Integral Distinguishers of Rijndael Family of Ciphers
- Slidex attacks on the Even-Mansour encryption scheme
- On the Role of Key Schedules in Attacks on Iterated Ciphers
- Title not available (Why is that?)
- On the sequential indifferentiability of the Lai-Massey construction
- Indifferentiability for public key cryptosystems
- Strengthening the Known-Key Security Notion for Block Ciphers
Uses Software
This page was built for publication: On the indifferentiability of key-alternating ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845693)
