Indifferentiability of 8-Round Feistel Networks
From MaRDI portal
Publication:2835584
DOI10.1007/978-3-662-53018-4_4zbMath1351.94040OpenAlexW2497919527MaRDI QIDQ2835584
John P. Steinberger, Yuanxi Dai
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_4
Related Items (14)
The key-dependent message security of key-alternating Feistel ciphers ⋮ KHAPE: Asymmetric PAKE from key-hiding key exchange ⋮ Asymmetric PAKE with low computation \textit{and} communication ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures ⋮ Public-Seed Pseudorandom Permutations
Cites Work
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Security and composition of multiparty cryptographic protocols
- On the Indifferentiability of Key-Alternating Ciphers
- How to Construct an Ideal Cipher from a Small Set of Public Permutations
- Security Proofs for Signature Schemes
- On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
- To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
- Careful with Composition: Limitations of the Indifferentiability Framework
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- A Domain Extender for the Ideal Cipher
- On Generalized Feistel Networks
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Tight Security Bounds for Key-Alternating Ciphers
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- 10-Round Feistel is Indifferentiable from an Ideal Cipher
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Indifferentiability of 8-Round Feistel Networks
