BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Indistinguishability up to Correctness\, and Adept Secret-Sharing
DTSTART:20180525T153000
DTEND:20180525T163000
DTSTAMP:20260929T111724Z
UID:b24f07b9e8ccb5620273c2684033b86e11ea28e35f530ba3050f4b8b
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Phillip Rogaway\nAbstract: For my entire career\, I’ve
  been obsessed with definitions. In this informal talk\, I’ll describe t
 he latest two I’ve worked on. The first is called IND|C\, indistinguisha
 bility up to correctness. Given games G and H and a correctness condition 
 C\, we define an advantage measure Adv^indc_{G\,H\,C} wherein G/H distingu
 ishing attacks are effaced\, generically and automatically\, to the extent
  that they are inevitable due to C. The hope is to use this to ground simp
 ler and more compelling definitions for a variety of complex cryptographic
  goals. The second definition I’ll describe is called adept secret-shari
 ng. It adjusts classical secret sharing to reflect a variety of concerns t
 hat arise naturally when one would use secret-sharing for its most basic p
 urpose\, yet escaped prior notice. The hope here is to engender cryptograp
 hic tools that directly support journalism and whistleblowing. Joint work 
 Mihir Bellare and Wei Dai (second topic) and Yusi Zhang (first topic)
LOCATION:INM 202 https://plan.epfl.ch/?room=INM202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR