Equivalence between MAC, WCR and PRF for blockcipher based constructions

DOI10.1007/978-3-319-12475-9_21MaRDI QIDQ2948158zbMATH OpenOpenAlexFDO

Authors Nilanjan Datta, Mridul Nandi

Publication date 29 September 2015

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12475-9_21

zbMATH Keywords

affine domain extensionblockcipherMACPRFWCR

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A unified method for improving PRF bounds for a class of blockcipher based MACs
• Full PRF-secure message authentication code based on tweakable block cipher
• The sum of CBC MACs is a secure PRF
• scientific article; zbMATH DE number 1302860
• Theory of Cryptography

Cited in

(1)

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

This page was built for publication: Equivalence between MAC, WCR and PRF for blockcipher based constructions

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