On the security of keyed hashing based on public permutations
From MaRDI portal
Publication:6186773
DOI10.1007/978-3-031-38548-3_20OpenAlexW4385654154MaRDI QIDQ6186773FDOQ6186773
Authors: Jonathan Fuchs, Yann Rotella, Joan Daemen
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38548-3_20
Recommendations
Cites Work
- Fast Software Encryption
- New hash functions and their use in authentication and set equality
- On fast and provably secure message authentication based on universal hashing
- A construction of a cipher from a single pseudorandom permutation.
- On the Indifferentiability of the Sponge Construction
- Keying hash functions for message authentication
- Title not available (Why is that?)
- Title not available (Why is that?)
- OMAC: one-key CBC MAC.
- Fast Software Encryption
- Differential Propagation Analysis of Keccak
- Full-state keyed duplex with built-in multi-user support
- How to stretch random functions: The security of protected counter sums
- A MAC mode for lightweight block ciphers
- Thinking outside the superbox
Cited In (3)
This page was built for publication: On the security of keyed hashing based on public permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186773)