prov:value
| - o be the probability that the algorithm B outputs ???(P, P)abc when the inputs to the algorithm are G1, G2, ???, P, aP, bP, and cP, where (G1, G2, ???) is the output of IG for a sufficiently large security parameter K, P is a random generator of G1, and a, b, and c are random elements of Z/qZ. The assumption underlying the Bilinear Diffie-Hellman problem is that AdvIG(B) is negligible for all effi
|