Explore a comprehensive talk from Eurocrypt 2012 on message authentication, presented by authors Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, and Daniel Wichs. Delve into the intricacies of Message Authentication Codes (MACs) and their algebraic counterparts. Examine key concepts such as selective security, indistinguishability, and various MAC definitions. Discover transformations and constructions of algebraic MACs, including methods for extending from one to many verification queries and achieving full security from selective security. Learn about key-homomorphic weak PRFs, signature-based constructions, and the LPN-based approach. Gain insights into domain extension techniques and the latest advancements in cryptographic message authentication.
Overview
Syllabus
Message Authentication Codes
Algebraic MAC/PRF
Definitions of MACS
Selective security and Indistinguishability
Our Results (1) Transformations
Our Results (2) Constructions of algebraic MACs
From one to many verification queries
From selective to full security & domain extension
Construction from key-homomorphic weak PRF
Constructions from signatures
Construction from LPN [KPCJV11]
Taught by
TheIACR
