BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260427T140733Z
UID:592ed0c19dc46913748531@ist.ac.at
DTSTART:20170609T090000
DTEND:20170609T100000
DESCRIPTION:Speaker: Michal Rybar\nhosted by Sandra Siegert\nAbstract: Mess
 age authentication is one of the basic tasks in cryptography. Even though 
 message authentication codes are around for decades\, for many of them the
 ir exact security is not known. In the talk you will see two examples of a
 lgorithms where it was worth re-visiting their proofs of security. New pro
 ofs for these constructions will be explained\, as well as new matching at
 tacks. Together\, they expose the true security of both constructions.\n\n
 =====================\nMichal Rybár is a Ph.D. candidate in the Pietrzak 
 group\, working on message authentication codes and symmetric cryptography
 . He obtained his Master's degree from the University of Bristol in the Un
 ited Kingdom\, before he joined IST in 2012.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
 TA
ORGANIZER:tchan@ist.ac.at
SUMMARY:Michal Rybar: Michal Rybar's Thesis Defense: (The exact security of
 ) Message Authentication Codes
URL:https://talks-calendar.ista.ac.at/events/646
END:VEVENT
END:VCALENDAR