Slide 62
Slide 62 text
Blind evaluation of
t(x)h(x) = w(x)v(x)
• Solving for x will be really hard, as degree of this polynomial can go as much as
2^21
• To make our proof efficient, we chose a random s, s.t
This reduces our problem to equating variables and doing simple multiplication
and addition.
Even so, it is compute intensive work.
Instead of (s0
, s1
, s2
…sd
), we chose to send (E(s0
), E(s1
), E(s2
)…E(sd
) ), where d
is degree of polynomial, and can be published in CRS.
S is one of those parameters that needs to be destroyed.
However Alice may ignore (E(s0
), E(s1
), E(s2
)…E(sd
) ) and pick her own values,
so we need to verify the evaluation of polynomials
t(s)h(s) = w(s)v(s)