E-MACs: towards more secure and more efficient constructions of secure channels

DOI10.1007/978-3-642-24209-0_20MaRDI QIDQ3094997zbMATH OpenOpenAlexFDO

Authors Basel Alomair, Radha Poovendran

Publication date 27 October 2011

Published in Information Security and Cryptology - ICISC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24209-0_20

zbMATH Keywords

authenticated encryptionauthenticityconfidentialityencrypt-and-authenticatemessage authentication code (MAC)universal hash families

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Information theoretically secure encryption with almost free authentication
• Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization
• Fast and Secure CBC-Type MAC Algorithms
• Message authentication, revisited
• The sum of CBC MACs is a secure PRF

Cited in

(8)

• \(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• Information theoretically secure encryption with almost free authentication
• Another Look at Security Theorems for 1-Key Nested MACs
• E-MACs: Toward More Secure and More Efficient Constructions of Secure Channels
• Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}

This page was built for publication: \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels

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