3
$\begingroup$

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

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?

$\endgroup$
2
  • 5
    $\begingroup$ Have you looked at How to Simulate It by our very own Yehuda Lindell? $\endgroup$ – Mikero May 7 at 14:07
  • $\begingroup$ yes, but it just focuses on stand-alone model, just for sequential composition. Not the same as UC, which is for concurrent composition $\endgroup$ – user77340 May 8 at 1:50

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.