Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
From MaRDI portal
Publication:2055608
DOI10.1007/978-3-030-45721-1_8zbMath1479.94337OpenAlexW3013199598MaRDI QIDQ2055608
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_8
Related Items (8)
\(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Multi-user security of the sum of truncated random permutations ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Quantum attacks against BBB secure PRFs or MACs built from public random permutations ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Improved security analysis for nonce-based enhanced hash-then-mask MACs ⋮ Multi-user BBB security of public permutations based MAC
Cites Work
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Information-theoretic indistinguishability via the chi-squared method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- The iterated random function problem
- A note on the chi-square method: a tool for proving cryptographic security
- Analysis of the single-permutation encrypted Davies-Meyer construction
- How to build pseudorandom functions from public random permutations
- \(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- The Iterated Random Permutation Problem with Applications to Cascade Encryption
- PRESENT: An Ultra-Lightweight Block Cipher
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
- GIFT: A Small Present
- The Sum of CBC MACs Is a Secure PRF
- A New Variant of PMAC: Beyond the Birthday Bound
- On the Indifferentiability of the Sponge Construction
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
This page was built for publication: Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
