Another Look at Security Theorems for 1-Key Nested MACs

DOI10.1007/978-3-319-10683-0_4MaRDI QIDQ5255843zbMATH OpenOpenAlexFDO

Authors Neal Koblitz, Alfred Menezes

Publication date 22 June 2015

Published in Open Problems in Mathematics and Computational Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10683-0_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the security of two MAC algorithms
• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• A Note on the Security Framework of Two-key DbHtS MACs
• scientific article; zbMATH DE number 1759778
• Improved security bound of LightMAC\_Plus and its single-key variant
• On weak keys and forgery attacks against polynomial-based MAC schemes
• On weak keys and forgery attacks against polynomial-based MAC schemes
• \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels

Cited in

(3)

• On the cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012
• Improving tightness gap of GGM construction and its applications
• The random oracle model: a twenty-year retrospective

This page was built for publication: Another Look at Security Theorems for 1-Key Nested MACs

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