Cyber Security Seminar on Splitting Authentication Codes with Perfect Secrecy
New perspectives on splitting authentication codes with perfect secrecy
Authentication codes are an unconditionally secure tool for providing authentication of messages sent between two users who share a key. Authentication codes with perfect secrecy also provide confidentiality of the messages. The perfect secrecy property of authentication codes has been well studied since the 90s, but less attention has been paid to the case of perfect secrecy for splitting authentication codes, in which the encodings of the users messages under a given key involve some randomness.
In this talk we explore how various symmetry properties of splitting authentication codes relate to the property of perfect secrecy and how they can be exploited to give new constructions of authentication codes with useful properties. These approaches can also be used to shed light on connections between authentication codes and the algebraic manipulation detection codes introduced by Cramer et al. in Eurocrypt 2008.
Meeting ID: 921 6847 3533, Passcode: 213671
Maura Paterson (Birkbeck, University of London)
Maura Paterson is a professor of mathematics at Birkbeck, University of London. She obtained her PhD from Royal Holloway in 2005. Her area of research interest is the study of combinatorial problems arising from applications in cryptography and information security.