A list adversary for a function f : {0, 1}" → {0, 1} gets input y = {0, 1}, and outputs a list L = L(y) of a polynomial number of strings in {0,1}n. The success probability of a list adversary is Pr [x L(f(x))]. x+{0,1}n Prove that if f is a one-way function, then all PPT list adversaries have negligible success probability.

A list adversary for a function f : {0, 1}" → {0, 1} gets input y = {0, 1}, and outputs a list L = L(y) of a polynomial number of strings in {0,1}n. The success probability of a list adversary is Pr [x L(f(x))]. x+{0,1}n Prove that if f is a one-way function, then all PPT list adversaries have negligible success probability.

Algebra & Trigonometry with Analytic Geometry

13th Edition

ISBN:9781133382119

Author:Swokowski

Publisher:Swokowski

Chapter4: Polynomial And Rational Functions

Section4.3: Zeros Of Polynomials

Problem 65E

See similar textbooks