MAC Reforgeability

DOI10.1007/978-3-642-03317-9_21zbMath1248.94058OpenAlexW2911390391MaRDI QIDQ3391581

M. Cochran, John Black

Publication date: 11 August 2009

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

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

zbMATH Keywords

provable securitymessage authentication codesbirthday attacks

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Optimal forgeries against polynomial-based MACs and GCM ⋮ Security analysis of randomize-hash-then-sign digital signatures ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ Quantum linearization attacks ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Cryptanalysis of OCB2: attacks on authenticity and confidentiality ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ Криптосистема блочного гаммирования с аутентификацией

This page was built for publication: MAC Reforgeability