A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
From MaRDI portal
(Redirected from Publication:5502805)
Recommendations
- On the XOR of multiple random permutations
- Generic attacks for the Xor of k random permutations
- The indistinguishability of the XOR of k permutations
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
Cites work
- A Combinatorial Problem on Abelian Groups
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Advances in Cryptology - CRYPTO 2003
- Foiling birthday attacks in length-doubling transformations
- Generic attacks for the Xor of k random permutations
- scientific article; zbMATH DE number 3683884 (Why is no real title available?)
- scientific article; zbMATH DE number 1302860 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- scientific article; zbMATH DE number 2009979 (Why is no real title available?)
- scientific article; zbMATH DE number 862975 (Why is no real title available?)
- The sum of PRPs is a secure PRF
Cited in
(43)- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- XOR of PRPs in a quantum world
- Mirror theory and cryptography
- A note on the chi-square method: a tool for proving cryptographic security
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- The summation-truncation hybrid: reusing discarded bits for free
- Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- How to build optimally secure PRFs using block ciphers
- On the XOR of multiple random permutations
- 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
- Generic attacks for the Xor of k random permutations
- XLS is not a strong pseudorandom permutation
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- The indistinguishability of the XOR of k permutations
- How to build fully secure tweakable blockciphers from classical blockciphers
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- Random number generators based on permutations can pass the collision test
- A Proof of Security in O(2 n ) for the Benes Scheme
- The “Coefficients H” Technique
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- scientific article; zbMATH DE number 7758304 (Why is no real title available?)
- 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
- \textsf{LightMAC}: fork it and make it faster
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
- Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis
- Towards optimally secure deterministic authenticated encryption schemes
- Mind the bad norms. Revisiting compressed oracle-based quantum indistinguishability proofs
- How to build a short-input random oracle from public random permutations
- Block cipher doubling for a post-quantum world
This page was built for publication: A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502805)
