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

Edward A. Hirsch, Dmitry M. Itsykson

Research outputpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationLogic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings
Pages208-217
Number of pages10
DOIs
Publication statusPublished - 28 Jul 2008
Event15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008 - Edinburgh
Duration: 1 Jul 20084 Jul 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5110 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008
CountryUnited Kingdom
CityEdinburgh
Period1/07/084/07/08

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An infinitely-often one-way function based on an average-case assumption'. Together they form a unique fingerprint.

  • Cite this

    Hirsch, E. A., & Itsykson, D. M. (2008). An infinitely-often one-way function based on an average-case assumption. In Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings (pp. 208-217). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5110 LNAI). https://doi.org/10.1007/978-3-540-69937-8_18