TY - JOUR
T1 - An infinitely-often one-way function based on an average-case assumption
AU - Hirsch, E. A.
AU - Itsykson, D. M.
PY - 2010
Y1 - 2010
N2 - We assume the existence of a function f that is computable in polynomial time but cannot be inverted by a randomized average-case polynomial algorithm. The cryptographic setting is, however, different: even for a weak one-way function, a successful adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f.
AB - We assume the existence of a function f that is computable in polynomial time but cannot be inverted by a randomized average-case polynomial algorithm. The cryptographic setting is, however, different: even for a weak one-way function, a successful adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f.
KW - Average-case complexity
KW - One-way function
UR - http://www.scopus.com/inward/record.url?scp=84861235113&partnerID=8YFLogxK
U2 - 10.1090/S1061-0022-10-01103-9
DO - 10.1090/S1061-0022-10-01103-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84861235113
SN - 1061-0022
VL - 21
SP - 459
EP - 468
JO - St. Petersburg Mathematical Journal
JF - St. Petersburg Mathematical Journal
IS - 3
ER -