Indistinguishability up to Correctness, and Adept Secret-Sharing
Event details
| Date | 25.05.2018 |
| Hour | 15:30 › 16:30 |
| Speaker | Prof. Phillip Rogaway |
| Location | |
| Category | Conferences - Seminars |
Abstract: For my entire career, I’ve been obsessed with definitions. In this informal talk, I’ll describe the latest two I’ve worked on. The first is called IND|C, indistinguishability 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 distinguishing attacks are effaced, generically and automatically, to the extent that they are inevitable due to C. The hope is to use this to ground simpler and more compelling definitions for a variety of complex cryptographic goals. The second definition I’ll describe is called adept secret-sharing. It adjusts classical secret sharing to reflect a variety of concerns that arise naturally when one would use secret-sharing for its most basic purpose, yet escaped prior notice. The hope here is to engender cryptographic tools that directly support journalism and whistleblowing. Joint work Mihir Bellare and Wei Dai (second topic) and Yusi Zhang (first topic)
Practical information
- General public
- Free
Organizer
- LASEC