log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Adaptive Multi-party Non-interactive key Exchange Without Setup
Vanishree Rao
MC2 conference room
Friday, August 22, 2014, 11:00-11:59 am Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

Diffie and Hellman presented the first non-interactive key exchange (NIKE) for two parties. Until recently, it was not known how to perform multi-party NIKE. The recent breakthrough results on constructions of multilinear maps and indistinguishability obfuscation have led to advancements in the area of multi-party NIKE by Boneh and Zhandry. However, just like in the other applications of multilinear maps, the known constructions of multi-party NIKE based on multilinear maps have only selective security: that is, the constructions can be proven secure only against adversaries that attack a known set of parties not adaptively depending on, say the public parameters. Achieving adaptively secure multi-party NIKE was still left as an important open problem. 

Recently, Hofheinz showed how to get adaptive multi-party NIKE in the random-oracle model, still leaving open the problem of realizing it in the standard model. We settle this open problem. Furthermore, we show how to achieve it without any set up. Our construction is based on multilinear maps and indistinguishability obfuscation. The novel techniques presented might be of independent interest in achieving adaptive security for other primitives based on indistinguishability obfuscation.
This talk is organized by Jonathan Katz