Adaptive NIKE for Unbounded Parties
Shafik Nassar
Abstract:
Non-interactive key exchange (NIKE) allows users to agree on a shared secret key without explicit interaction. In this talk, we present the first construction of adaptively secure NIKE for unbound parties. We propose a scheme in the standard model that supports an unbounded number of honest and malicious users in the system, as well as unbounded party sizes, while tolerating a bounded number of dynamic user corruptions. The construction is based on sub-exponential indistinguishability obfuscation and sub-exponential fully-homomorphic encryption. Additionally, we show how to remove the bound on dynamic corruptions in the random oracle model, thus achieving the first fully adaptive unbounded NIKE in the ROM.
Based on a joint work with Brent Waters.
Bio:
Shafik is a 3rd year PhD student at UT Austin advised by Prof. Brent Waters and Prof. David Wu. He is interested in indistinguishability obfuscation, witness encryption and proof systems. Before coming to UT, he got his M.Sc. in Computer Science at the Technion, where he was advised by Prof. Ron Rothblum.