Hash-Function Based PRFs: AMAC and Its Multi-User Security
From MaRDI portal
Publication:2820497
DOI10.1007/978-3-662-49890-3_22zbMath1385.94010MaRDI 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
94A60: Cryptography
Related Items
The Multi-user Security of Double Encryption, Public-Seed Pseudorandom Permutations, Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds, 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, Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting, Connecting tweakable and multi-key blockcipher security, The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3, Practical significance of security bounds for standardized internally re-keyed block cipher modes