Cryptology ePrint Archive: Report 2013/873

Poly-Many Hardcore Bits for Any One-Way Function

Mihir Bellare and Igors Stepanovs and 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.

Category / Keywords: foundations / Hardcore predicates, indistinguishability obfuscation, one-way functions.

Date: received 27 Dec 2013, last revised 11 Feb 2014

Contact author: mihir at eng ucsd edu

Available format(s): PDF | BibTeX Citation

Version: 20140211:202933 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]