Indifferentiability beyond the birthday bound for the xor of two public random permutations
From MaRDI portal
Publication:3058713
DOI10.1007/978-3-642-17401-8_6zbMATH Open1253.94061OpenAlexW1507258659MaRDI QIDQ3058713FDOQ3058713
Authors: Avradip Mandal, Jacques Patarin, Valérie Nachef 
Publication date: 7 December 2010
Published in: Progress in Cryptology - INDOCRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17401-8_6
Recommendations
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- On the XOR of multiple random permutations
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- The indistinguishability of the XOR of \(k\) permutations
- Generic attacks for the Xor of \(k\) random permutations
indifferentiabilitybuilding random oracles from ideal block ciphersLuby-Rackoff backwards with public permutations
Cited In (17)
- Towards defeating backdoored random oracles: indifferentiability with bounded adaptivity
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
- Block-cipher-based tree hashing
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- Revisiting the indifferentiability of the sum of permutations
- The indistinguishability of the XOR of \(k\) permutations
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Domain Extension of Public Random Functions: Beyond the Birthday Barrier
- How to build pseudorandom functions from public random permutations
- On the XOR of multiple random permutations
- Open problems in hash function security
- Generic attacks for the Xor of \(k\) random permutations
- Title not available (Why is that?)
- Security of truncated permutation without initial value
This page was built for publication: Indifferentiability beyond the birthday bound for the xor of two public random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058713)
