A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
From MaRDI portal
Publication:5502805
DOI10.1007/978-3-540-85093-9_22zbMath1162.94397OpenAlexW1583969855MaRDI QIDQ5502805
Publication date: 9 January 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85093-9_22
pseudorandom functionspseudorandom permutationsLuby-Rackoff backwardssecurity beyond the birthday bound
Related Items (27)
Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Mirror theory and cryptography ⋮ Cryptanalysis of Round-Reduced $$\mathtt{LED}$$ ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers ⋮ Multi-user security of the sum of truncated random permutations ⋮ Improved multi-user security using the squared-ratio method ⋮ Luby-Rackoff backwards with more users and more security ⋮ The Relation Between CENC and NEMO ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ How to build optimally secure PRFs using block ciphers ⋮ A note on the chi-square method: a tool for proving cryptographic security ⋮ On the XOR of Multiple Random Permutations ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model ⋮ Random number generators based on permutations can pass the collision test ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 ⋮ The “Coefficients H” Technique ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ A Proof of Security in O(2 n ) for the Xor of Two Random Permutations ⋮ The summation-truncation hybrid: reusing discarded bits for free
Cites Work
- Generic Attacks for the Xor of k Random Permutations
- Foiling Birthday Attacks in Length-Doubling Transformations
- Advances in Cryptology - CRYPTO 2003
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- A Combinatorial Problem on Abelian Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
