How to build an ideal cipher: the indifferentiability of the Feistel construction
From MaRDI portal
Publication:271585
DOI10.1007/s00145-014-9189-6zbMath1351.94037WikidataQ122228210 ScholiaQ122228210MaRDI QIDQ271585
Robin Künzler, Thomas Holenstein, Yannick Seurin, Jean-Sébastien Coron, Stefano Tessaro, Jacques Patarin
Publication date: 7 April 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9189-6
94A60: Cryptography
Related Items
Unnamed Item, Public-Seed Pseudorandom Permutations, Keyed sum of permutations: a simpler RP-based PRF, Sequential indifferentiability of confusion-diffusion networks, Lifting standard model reductions to common setup assumptions, Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules), Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour, Indifferentiability for public key cryptosystems, Quantifying the security cost of migrating protocols to practice, Incompressible encodings, Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff, Beyond-birthday security for permutation-based Feistel networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of a cipher from a single pseudorandom permutation.
- Short signatures from the Weil pairing
- On the Indifferentiability of Key-Alternating Ciphers
- How to Construct an Ideal Cipher from a Small Set of Public Permutations
- Minimizing the Two-Round Even-Mansour Cipher
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
- Careful with Composition: Limitations of the Indifferentiability Framework
- The random oracle methodology, revisited
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- Communication Theory of Secrecy Systems*
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Non-Malleable Codes
- Identity-Based Encryption from the Weil Pairing
- Resource-Restricted Indifferentiability
- 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
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Theory of Cryptography
- Theory of Cryptography
- How to protect DES against exhaustive key search (an analysis of DESX).
