Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
In normal security proof, just challenger and adversary. In security reduction proof, two adversary, $A$ and $B$ algorithms.If $A$ succeeds in breaking security, then $B$ is also sure to break the security. If so?
@Mhy.Why $B$ construct simulation for $A$? If random oracle model is used,simulation is required? How to know the scheme needs to use random oracle model? May be I don't know nature of security proofs by reduction.