Badger – A Fast and Provably Secure MAC

DOI10.1007/11496137_13zbMATH Open1126.68384OpenAlexW1583184880MaRDI QIDQ3593142FDOQ3593142

Authors: Martin Boesgaard, Thomas Christensen, Erik Zenner 

Publication date: 24 September 2007

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496137_13

Recommendations

• scientific article; zbMATH DE number 1030977
• Bucket hashing and its application to fast message authentication
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• scientific article; zbMATH DE number 1418297
• Publication:4941858

zbMATH Keywords

treeMACpseudo-random generatoruniversal hash

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (10)

• HalftimeHash: modern hashing without 64-bit multipliers or finite fields
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• Related-key almost universal hash functions: definitions, constructions and applications
• Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch
• A Tight Bound for EMAC
• A new authenticated encryption mode for arbitrary block cipher based on universal hash function
• On a family of universal hash functions
• The committing security of MACs with applications to generic composition
• RIV for robust authenticated encryption
• \(\Gamma\)-MAC\([H,P]\) -- a new universal MAC scheme

This page was built for publication: Badger – A Fast and Provably Secure MAC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593142)