An efficient MAC for short messages

DOI10.1007/3-540-36492-7_23MaRDI QIDQ4413873zbMATH OpenFDO

Authors Sarvar Patel

Publication date 21 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2595/25950353.htm

zbMATH Keywords

message authentication

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• MAC aggregation with message multiplicity
• Efficient coding of formalized messages
• UMAC: Fast and secure message authentication
• A MAC mode for lightweight block ciphers
• BCBC: a more efficient MAC algorithm
• Short messages
• Efficient broadcast encryption with personalized messages

Cited in

(4)

• “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
• New (two-track-)MAC based on the two trails of RIPEMD
• A new authentication procedure for client-server applications using HMAC
• Boosting Merkle-Damgård Hashing for Message Authentication

This page was built for publication: An efficient MAC for short messages

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