We describe several applications that provide a natural motivation for this notion; these include generating the trusted parameters for many schemes from just a single trusted setup. We further demonstrate the versatility of universal samplers by showing how they give rise to simple constructions of identity-based encryption and multiparty key exchange. In particular, we construct adaptively secure non-interactive multiparty key exchange in the random oracle model based on indistinguishability obfuscation; obtaining the first known construction of adaptively secure NIKE without complexity leveraging.
We give a solution that shows how to transform any random oracle into a universal sampler scheme, based on indistinguishability obfuscation. At the heart of our construction and proof is a new technique we call “delayed backdoor programming” that we believe will have other applications.Category / Keywords: cryptographic protocols / obfuscation Date: received 27 Jun 2014, last revised 18 Jul 2015 Contact author: dakshita at cs ucla edu Available format(s): PDF | BibTeX Citation Version: 20150719:042009 (All versions of this report) Short URL: ia.cr/2014/507 Discussion forum: Show discussion | Start new discussion