TY - GEN

T1 - An infinitely-often one-way function based on an average-case assumption

AU - Hirsch, Edward A.

AU - Itsykson, Dmitry M.

PY - 2008

Y1 - 2008

N2 - We assume the existence of a function f that is computable in polynomial time but its inverse function is not computable in randomized average-case polynomial time. The cryptographic setting is, however, different: even for a weak one-way function, every possible 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 its inverse function is not computable in randomized average-case polynomial time. The cryptographic setting is, however, different: even for a weak one-way function, every possible adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f.

UR - http://www.scopus.com/inward/record.url?scp=47749149267&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69937-8_18

DO - 10.1007/978-3-540-69937-8_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:47749149267

SN - 3540699368

SN - 9783540699361

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 208

EP - 217

BT - Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings

T2 - 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008

Y2 - 1 July 2008 through 4 July 2008

ER -