1. (Difficult): 9.1/9.2- So now we don't care about giving m away, we just care about the signature? Because m is essentially public once (m,y) is made public.
9.2- Why is finding r more difficult than a discrete log problem.? Why does finding d allow Eve to compute alpha to the k?
9.4- Why does the birthday attack halve the number of bits under attack? Wasn't 2^30 arbitrary? Couldn't he find more or less places to change than 30?
2. (Reflection): What real world examples are there of blind signatures?
Also, I like the hash function, signatures scheme combo. Great solution so our signatures isn't forever long.
Finally, I like that Alice foiled Fred anyway. Haha!
No comments:
Post a Comment