The following publications are possibly variants of this publication:
- Universally Composable Two-Party and Multi-Party Secure ComputationRan Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai. iacr, 2002:140, 2002. [doi]
- Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token ModelNishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti. iacr, 2017:1092, 2017. [doi]
- On the Limitations of Universally Composable Two-Party Computation Without Set-up AssumptionsRan Canetti, Eyal Kushilevitz, Yehuda Lindell. iacr, 2004:116, 2004. [doi]
- On the Limitations of Universally Composable Two-Party Computation Without Set-Up AssumptionsRan Canetti, Eyal Kushilevitz, Yehuda Lindell. joc, 19(2):135-167, 2006. [doi]
- On the Limitations of Universally Composable Two-Party Computation without Set-up AssumptionsRan Canetti, Eyal Kushilevitz, Yehuda Lindell. eurocrypt 2003: 68-86 [doi]
- Incoercible Multi-party Computation and Universally Composable Receipt-Free VotingJoël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, Vassilis Zikas. crypto 2015: 763-780 [doi]