Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations

DOI10.1007/978-3-642-17401-8_6zbMath1253.94061OpenAlexW1507258659MaRDI QIDQ3058713

Valérie Nachef, Jacques Patarin, Avradip Mandal

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

zbMATH Keywords

indifferentiabilitybuilding random oracles from ideal block ciphersLuby-Rackoff backwards with public permutations

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Open problems in hash function security ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Block-cipher-based tree hashing ⋮ Security of truncated permutation without initial value ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ On the XOR of Multiple Random Permutations ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction

This page was built for publication: Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations