Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6

DOI10.1007/978-3-642-03317-9_7zbMath1248.94065OpenAlexW2140313858MaRDI QIDQ3391566

Yevgeniy Dodis, Emily S. Shen, Leonid Reyzin, Ronald L. Rivest

Publication date: 11 August 2009

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03317-9_7

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ From Indifferentiability to Constructive Cryptography (and Back) ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Block-cipher-based tree hashing ⋮ Security of truncated permutation without initial value ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Crooked indifferentiability of enveloped XOR revisited ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ Indifferentiability of 8-Round Feistel Networks