Recently, I learn Ran Canetti's famous paper, "Universally Composable Security: A New Paradigm for Cryptographic Protocols". But I find it very difficult to grasp. When I read the paper that proves the security of the protocols in the UC-framework, I can understand it a little bit, but I still cannot write the proof myself.
I have read some answers on this website, including
- Simulation-based proofs and universal composability proofs,
- What is universal composability guaranteeing, specifically? Where does it apply, and where does it not?,
but they just teach me what is UC-framework, while I am still confused on how to write the proof(how to define the ideal functionality, etc.) after I read them. So is there any other good way to learn to write the proof in UC-framework?
