Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Negligible function question.

  1. Mar 15, 2006 #1
    There is a question:

    In constructing obfuscators for point-functions theory, there is a statement that there exists a polynomial-time computable permutation
    [tex]pi : B^n -> B^n[/tex] and a constant c such that for every polynomial s(n) and every adversary A of size s for all sufficiently large n,

    [tex] Prob[A(pi(x)) = x] <= S(n)^c/2^n [/tex]

    I am trying to prove that
    where s is a polynomial and c is a constant, is also a negligible function.

    Could anyone help me with that?
    Last edited: Mar 15, 2006
  2. jcsd
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted