A unified method for improving PRF bounds for a class of blockcipher based MACs

DOI10.1007/978-3-642-13858-4_12MaRDI QIDQ3577960zbMATH OpenOpenAlexFDO

Authors Mridul Nandi

Publication date 13 July 2010

Published in Fast Software Encryption (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13858-4_12

zbMATH Keywords

affine domain extensionCBC-MACPRFrandom permutation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Equivalence between MAC, WCR and PRF for blockcipher based constructions
• Improved Security Analyses for CBC MACs
• The sum of CBC MACs is a secure PRF
• Blockcipher-based MACs: beyond the birthday bound without message length
• Full PRF-secure message authentication code based on tweakable block cipher

Cited in

(8)

• On the optimality of non-linear computations for symmetric key primitives
• Hardness-preserving reductions via cuckoo hashing
• PMAC with parity: minimizing the query-length influence
• Equivalence between MAC, WCR and PRF for blockcipher based constructions
• Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
• Revisiting structure graphs: applications to CBC-MAC and EMAC
• Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
• Key-reduced variants of 3Kf9 with beyond-birthday-bound security

Describes a project that uses

Uses Software

• OMAC

This page was built for publication: A unified method for improving PRF bounds for a class of blockcipher based MACs

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