Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited

DOI10.1007/978-3-642-13858-4_14MaRDI QIDQ3577962zbMATHOpenAlexFDO

Authors Liting Zhang, Wenling Wu, Peng Wang, Lei Zhang, Shuang Wu, Bo Liang

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_14

zbMATH Keywords

Block CipherProvable SecurityMessage Authentication CodeMode of Operation

Mathematics Subject Classification ID

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

Recommendations

• A unified method for improving PRF bounds for a class of blockcipher based MACs
• scientific article; zbMATH DE number 1302852
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Blockcipher-based MACs: beyond the birthday bound without message length
• \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels
• scientific article; zbMATH DE number 2089141
• scientific article; zbMATH DE number 1942429

Cited in

(4)

• Secure message authentication against related-key attack
• Hash functions from defective ideal ciphers
• Efficient leakage-resilient MACs without idealized assumptions
• Strong authenticity with leakage under weak and falsifiable physical assumptions

This page was built for publication: Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited

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