Public Key Cryptography
Invited Talk 1 - Monday 26, 11:20-12:20
Speaker: Hugo Krawczyk - IBM Research
Title: Oblivious Pseudo-Random Functions and Their Applications to Password Protocols
Abstract: Oblivious Pseudo-Random Functions (OPRF) are a remarkable cryptographic tool with applications to many privacy-preserving tasks, e.g., set intersection, private information retrieval, searchable encryption. In the last years, they have been used as a central component for building very practical password-based protocols, including password authenticated key exchange and password-protected storage and retrieval of online secret information (e.g., bitcoin wallets). In this talk we will survey the uses of OPRFs with special focus on their application to password-related tasks and the significant functional and security improvements they bring to these protocols.
Bio: Hugo Krawczyk is an IBM Fellow and Distinguished Research Staff Member with the Cryptography Group at the IBM T.J. Watson Research Center whose interests span theoretical and applied aspects of cryptography. He has contributed to the cryptographic design of numerous Internet standards, particularly IPsec, IKE, and SSL/TLS, and is a co-inventor of the HMAC message authentication algorithm. His most recent work in this area includes designs for TLS 1.3, the next generation TLS, and HKDF, the emerging standard for key derivation adopted by TLS 1.3, Signal, WhatsApp, Facebook Messenger and more. He has contributed to multiple areas of cryptography including to the theory and practice of key exchange, threshold and proactive cryptosystems, password authentication, and search on encrypted data. He is a Fellow of the International Association of Cryptologic Research (IACR) and the recipient of the 2015 RSA Conference Award for Excellence in the Field of Mathematics, the 2018 Levchin Prize for Contributions to Real-World Cryptography, and of multiple IBM awards, including two corporate awards.
Invited Talk 2 - Wednesday 28, 11:30-12:30
Speaker: Elette Boyle - IDC Herzliya, Israel
Title: How (and Why) to Compute on Secret-Shared Values
Abstract: A Homomorphic Secret Sharing (HSS) scheme is a secret sharing scheme that allows locally mapping shares of s to compact shares of f(s) for a given function f. Many exciting new constructions and applications of HSS have emerged in the last few years, yielding implications ranging from efficient private database manipulation, to sublinear-communication secure computation protocols, to worst-case to average-case reductions. In this talk we survey the state of the art in HSS, describing the landscape of what is known and what is still to discover.
Bio: Elette Boyle is presently assistant professor and Director of the FACT (Foundations & Applications of Cryptographic Theory) Center at IDC Herzliya, Israel. She received her PhD from MIT, and served as a postdoctoral researcher at Cornell University and at the Technion. Elette's research focuses in secure multi-party computation, oblivious data structures, and distributed algorithm design. Her recent work on homomorphic secret sharing and its implications to secure computation was selected as Best Paper of Crypto 2016.