On the Unprovable Security of 2-Key XCBC

DOI10.1007/978-3-540-70500-0_17MaRDI QIDQ3511165zbMATH OpenOpenAlexFDO

Authors Peng Wang, Dengguo Feng, Wenling Wu, Liting Zhang

Publication date 8 July 2008

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70500-0_17

zbMATH Keywords

BlockcipherBlockcipher mode of operationMessage authentication codeProvable securityRelated-key attack

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1980971
• Secure message authentication against related-key attack
• CBC MACs for arbitrary-length messages: The three-key constructions
• scientific article; zbMATH DE number 1759779
• The sum of CBC MACs is a secure PRF

Cites work

• CBC MAC for real-time data sources
• Cryptography and Coding
• scientific article; zbMATH DE number 1951605 (Why is no real title available?)
• scientific article; zbMATH DE number 1962141 (Why is no real title available?)
• scientific article; zbMATH DE number 1980971 (Why is no real title available?)
• scientific article; zbMATH DE number 2009976 (Why is no real title available?)
• scientific article; zbMATH DE number 1759779 (Why is no real title available?)
• scientific article; zbMATH DE number 1406792 (Why is no real title available?)
• Information Security and Cryptology - ICISC 2003
• OMAC: one-key CBC MAC.
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function

Cited in

(1)

• scientific article; zbMATH DE number 1980971 (Why is no real title available?)

This page was built for publication: On the Unprovable Security of 2-Key XCBC

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