scientific article; zbMATH DE number 1302860
From MaRDI portal
Publication:4249345
Recommendations
Cited in
(32)- Multi-user security of the sum of truncated random permutations
- Luby-Rackoff backwards with more users and more security
- Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs
- Improved multi-user security using the squared-ratio method
- Equivalence between MAC, WCR and PRF for blockcipher based constructions
- Tight security of cascaded LRW2
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Optimal forgeries against polynomial-based MACs and GCM
- A note on the chi-square method: a tool for proving cryptographic security
- Performance improvement for the GGM-construction of pseudorandom functions
- How to build optimally secure PRFs using block ciphers
- Hardness preserving constructions of pseudorandom functions
- Quantum attacks on PRFs based on public random permutations
- Keyed sum of permutations: a simpler RP-based PRF
- How many queries are needed to distinguish a truncated random permutation from a random function?
- The sum of PRPs is a secure PRF
- Revisiting the indifferentiability of the sum of permutations
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Leakage resilient value comparison with application to message authentication
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Theory of Cryptography
- On the XOR of multiple random permutations
- Information-theoretic security with asymmetries
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- scientific article; zbMATH DE number 1583802 (Why is no real title available?)
- The summation-truncation hybrid: reusing discarded bits for free
- On the streaming indistinguishability of a random permutation and a random function
- The advantage of truncated permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249345)
