Invited Talks



Invited Lectures

Speaker: Sanjam Garg
(University of California, Berkeley)
Title: New Advances in Secure RAM Computation
Abstract: Yao's garbled circuit construction is a fundamental construction in cryptography and recent efficiency optimizations have brought it much closer to practice. However, these constructions work only for circuits and garbling a RAM program involves the inefficient process of first converting it into a circuit. Towards the goal of avoiding this inefficiency, Lu and Ostrovsky (Eurocrypt 2013) introduced the notion of ``garbled RAM'' as a method to garble RAM programs directly. It can be seen as a RAM analogue of Yao's garbled circuits such that, the size of the garbled program and the time it takes to create and evaluate it, is proportional only to the running time on the RAM program rather than its circuit size.
In this talk, I will describe a construction with strictly poly-logarithmic overhead in both space and time, based only on the minimal and necessary assumption that one-way functions exist. Furthermore, this construction makes only black-box use of one-way functions. This scheme allows for garbling multiple programs being executed on a persistent database.
(Based on joint works with Steve Lu, Rafail Ostrovsky, and Alessandra Scafuro)
Biography: Sanjam Garg is an Assistant Professor at the University of California, Berkeley. Previously he was a Josef Raviv Memorial Postdoctoral Fellow at IBM Research T.J. Watson. His research interests are in cryptography and security, and more broadly in theoretical computer science. He obtained his Ph.D. from the University of California, Los Angeles in 2013 and his undergraduate degree from the Indian Institute of Technology, Delhi in 2008. He is the recipient of various honors such as the NSF CRII Award, the 2013 ACM Doctoral Dissertation Award and the best paper award at EUROCRYPT 2013.
Speaker: Phillip Rogaway
(University of California, Davis)
Title: Advances in Authenticated Encryption
Abstract: Authenticated encryption (AE) is a rare topic for so effectively bringing provable-security to cryptographic practice. I'll describe some recent advances in the AE, placing the ideas in their historical context. In particular, I'll look at robust AE and why it was developed, and I’ll describe a recent notion for online AE, and why it was developed. I’ll give a modern account of generic composition. Finally, I’ll talk a bit about the CAESAR competition, which drew 57 AE submissions.
Biography: Phil is a professor at the University of California, Davis, USA. He did his Ph.D. (1991) at MIT’s Theory of Computation group, joined IBM as a security architect, then came to the UCD (1994). For more than 20 years, Phil has worked to develop the line of work he calls practice-oriented provable security. Beyond his technical work, Prof. Rogaway is interested in social and ethical issues surrounding modern technology.
Speaker: Serge Vaudenay
(Ecole Polytechnique Fédérale de Lausanne)
Title: On Privacy for RFID
Abstract: Many wearable devices identify themselves in a pervasive way. But at the same time, people want to remain anonymous. Modeling anonymity and unlikability in identification protocols is a delicate issue. In this talk, we revisit the privacy model from Asiacrypt 2007. We show how to achieve forward-privacy (in the V07 sense) it using an IND-CCA secure cryptosystem with the PKC protocol. We review the impossibility result of strong privacy and the model extension from CANS 2012 to reach strong privacy (in the OV12 sense) using a plaintext-aware cryptosystem in the PKC protocol. We also discuss on the simplified model from ESORICS 2011 and achieve strong-privacy (in the HPVP11 sense) using IND-CCA security only. Finally, we apply these results to add privacy protection in distance bounding protocols.
Biography: Serge Vaudenay entered at the Ecole Normale Supérieure in Paris in 1989 with a major in mathematics. He received his PhD in computer sciences from University of Paris 7 - Denis Diderot in 1995. He subsequently became a research fellow at CNRS (National Center for Scientific Research in France). In 1999, he was appointed as a Professor at the EPFL, where he created the Security and Cryptography Laboratory.
He works on cryptography and the security of digital information. Most of his work relates to security analysis and provable security of cryptographic algorithms and protocols, specially in symmetric cryptography, post-quantum public-key cryptography, RFID protocols and distance bounding. He wrote an Essay on cryptography (in French, published by PPUR) and a textbook on cryptography (published by Springer). He was program chair of several research conferences and workshops: ACNS'14, INDOCRYPT'13, AFRICACRYPT'12, SAC'11, AFRICACRYPT'08, EUROCRYPT'06, MYCRYPT'05, PKC'05, SAC'01, and FSE'98. In 2007-12, he was an elected director of the IACR (International Association for Cryptologic Research).