Friday, July 25, 2008
3:30 pm, MC 5158

Alfred Menezes
University of Waterloo

One-More Discrete Logarithm Problems

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.