Proof of security for RSA signatures
For (a), what if you query the signing oracle on $m&#39; \equiv -m \mod N$?  Can you see how to compute $m^d$ given $(-m)^d$?  (Hint: $d$ is odd.)

For (b), try showing that doing this is equivalent to solving the RSA problem.