Signature scheme is strongly unforgeable. "making the message m being signed depend on the randomness r — we break the proof of security for the underlying signature."
From Paper: Strongly Unforgeable Signatures Based on Computational Diffie-Hellman - Dan Boneh, Emily Shen, and Brent Waters.
Can some one point out how a scheme can be broken when the message being signed depends on the randomness?
Thanks. Please let me know if I am not clear. The paper has it all.