One-More Discrete Logarithm Problems
|Affiliation:||University of Waterloo|
|Room:||Mathematics & Computer Building (MC) 5158|
There are many issues that arise in interpreting reductionist proofs of security of cryptographic protocols. I will consider the case of security proofs that rely on the hardness of non-standard one-more discrete logarithm and Diffie-Hellman problems.
This is joint work with Neal Koblitz.
200 University Avenue West
Waterloo, ON N2L 3G1