Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
From MaRDI portal
Publication:1648806
DOI10.1007/978-3-319-78381-9_15zbMath1423.94053OpenAlexW2795290478MaRDI QIDQ1648806
Srimanta Bhattacharya, Mridul Nandi
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_15
Related Items (11)
Beyond-birthday security for permutation-based Feistel networks ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Block-cipher-based tree hashing ⋮ Security of truncated permutation without initial value ⋮ Multi-user security of the sum of truncated random permutations ⋮ Luby-Rackoff backwards with more users and more security ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ZMAC: a fast tweakable block cipher mode for highly secure message authentication
- Information-theoretic indistinguishability via the chi-squared method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- How many queries are needed to distinguish a truncated random permutation from a random function?
- Decorrelation: a theory for block cipher security
- Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part I
- The advantage of truncated permutations
- On the XOR of Multiple Random Permutations
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
- The Indistinguishability of the XOR of $$k$$ Permutations
- Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
- Security Analysis of the Mode of JH Hash Function
- On the Indifferentiability of the Grøstl Hash Function
- Two-Server Password-Only Authenticated Key Exchange
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- The “Coefficients H” Technique
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Distance between sampling with and without replacement
- A New Variant of PMAC: Beyond the Birthday Bound
- Indifferentiability of the Sum of Random Permutations Toward Optimal Security
- Secure Communications over Insecure Channels Based on Short Authenticated Strings
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- On the Indifferentiability of the Sponge Construction
- Elements of Information Theory
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Theory of Cryptography
This page was built for publication: Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
