An Infinitely-Often One-Way Function Based on an Average-Case Assumption

Authors:
Edward A. Hirsch;Dmitry M. Itsykson
Affiliations:
Steklov Institute of Mathematics at St. Petersburg, , Petersburg, Russia 191023;Steklov Institute of Mathematics at St. Petersburg, , Petersburg, Russia 191023
Venue:
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Year:
2008

Citing 5
Cited 0

Average case complete problems

SIAM Journal on Computing
The Tale of One-Way Functions

Problems of Information Transmission
A personal view of average-case complexity

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Foundations of Cryptography: Volume 1

Foundations of Cryptography: Volume 1
Average-case complexity

Foundations and Trends® in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We assume the existence of a function fthat 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-oftenone-way function based on f.