To refer to this page use:
|Abstract:||A random oracle is an idealization that allows us to model a hash function as an oracle that will output a uniformly random string given any input. We introduce the notion of a universal sampler scheme that extends the notion of a random oracle, to a method of sampling securely from arbitrary distributions. 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.|
|Citation:||Hofheinz, Dennis, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, and Mark Zhandry. "How to Generate and Use Universal Samplers." In International Conference on the Theory and Application of Cryptology and Information Security (2016): pp. 715-744. doi:10.1007/978-3-662-53890-6_24|
|Pages:||715 - 744|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||International Conference on the Theory and Application of Cryptology and Information Security|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.