I am trying to find out how to write a security proof for a two-party computation problem.
I have read some examples to write simulators like $x_1 ∧ x_2$ problem and the example in Goldreich's book. I have also read some parts of Lindell's toturial . But I am still unsure about my understanding. I have also seen the paper which uses the game-based approach for its security analysis. I have also read this question
My questions are:
Can I use game-based approach to write my security proof for a two-party computation problem? Since there are only two parties involved? Or I always MUST use simulator-based approach to write the security proof for any multi (and two) party computation problem?
Does a privacy-preserving multi-party computation scheme (like the paper I mentioned) include less security guarantee? In other words, does a secure multi-party computation problem which uses simulation-based proof capture more security concerns than privacy?
