Hash-Function Based PRFs: AMAC and Its Multi-User Security

DOI10.1007/978-3-662-49890-3_22zbMath1385.94010OpenAlexW2505511021MaRDI QIDQ2820497

Daniel J. Bernstein, Stefano Tessaro, Mihir Bellare

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_22

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ Let attackers program ideal models: modularity and composability for adaptive compromise ⋮ When messages are keys: is HMAC a dual-PRF? ⋮ The Multi-user Security of Double Encryption ⋮ Public-Seed Pseudorandom Permutations ⋮ Practical significance of security bounds for standardized internally re-keyed block cipher modes ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ Multi-user BBB security of public permutations based MAC ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Collision-resistant and pseudorandom function based on Merkle-Damgård hash function ⋮ Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols ⋮ Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability

This page was built for publication: Hash-Function Based PRFs: AMAC and Its Multi-User Security