Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.94543OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716798

Ueli M. Maurer, Johan Sjödin

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

zbMATH Keywords

arbitrary-input-length (AIL)fixed-input-length (FIL)Message authentication code (MAC)variable-input-length (VIL)

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Generalizing PMAC Under Weaker Assumptions ⋮ CBCR: CBC MAC with rotating transformations ⋮ A simple variant of the Merkle-Damgård scheme with a permutation ⋮ Boosting Merkle-Damgård Hashing for Message Authentication ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ One-Key Compression Function Based MAC with Security Beyond Birthday Bound