[Resource Topic] 2013/873: Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation

Welcome to the resource topic for 2013/873

Title:
Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation

Authors: Mihir Bellare, Igors Stepanovs, Stefano Tessaro

Abstract:

We show how to extract an arbitrary polynomial number of simultaneously hardcore bits from any one-way function. In the case the one-way function is injective or has polynomially-bounded pre-image size, we assume the existence of indistinguishability obfuscation (iO). In the general case, we assume the existence of differing-input obfuscation (diO), but of a form weaker than full auxiliary-input diO. Our construction for injective one-way functions extends to extract hardcore bits on multiple, correlated inputs, yielding new D-PKE schemes. Of independent interest is a definitional framework for differing-inputs obfuscation in which security is parameterized by circuit-sampler classes.

ePrint: https://eprint.iacr.org/2013/873

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .