Explore a groundbreaking paper presentation from Asiacrypt 2017 that delves into blockcipher-based Message Authentication Codes (MACs) that surpass the birthday bound without relying on message length. Gain insights into Yusuke Naito's innovative research, which challenges traditional limitations in cryptographic security and offers potential advancements in MAC design and implementation.
Blockcipher Based MACs Beyond the Birthday Bound Without Message Length
Overview
Syllabus
Blockcipher based MACs Beyond the Birthday Bound without Message Length
Taught by
TheIACR
Related Courses
-
Generic Attacks Against Beyond Birthday Bound MACs
-
A New Variant of PMAC: Beyond the Birthday Bound
-
Encrypt or Decrypt to Make a Single Key Beyond Birthday Secure Nonce Based MAC
-
EWCDM - An Efficient, Beyond Birthday Secure, Nonce Misuse Resistant MAC
-
Automatic Search of Bit Based Division Property for ARX Ciphers and Word Based Division Property
-
Non Interactive Multiparty Computation Without Correlated Randomness
