You are looking at a specific version 20140211:202933 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Hardcore predicatesindistinguishability obfuscationone-way functions.
Contact author(s)
mihir @ eng ucsd edu
History
2014-09-15: last of 4 revisions
2013-12-29: received
See all versions
Short URL
https://ia.cr/2013/873
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.