E-MACs: Toward More Secure and More Efficient Constructions of Secure Channels

DOI10.1109/TC.2012.176MaRDI QIDQ5268369zbMATH OpenFDO

Authors Basel Alomair, Radha Poovendran

Publication date 20 June 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2012.176

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels
• Efficient leakage-resilient MACs without idealized assumptions
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• An efficient MAC scheme for secure network coding with probabilistic detection
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}
• On the adaptive security of MACs and PRFs
• On the security of two MAC algorithms
• Tight security bounds for double-block hash-then-sum MACs

Cited in

(3)

• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}

This page was built for publication: E-MACs: Toward 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 Q5268369)