1. B. Barak, A. Sahai, How to play almost any mental game over the net—concurrent composition via super-polynomial simulation, in 46th FOCS (2005), pp. 543–552
2. B. Barak, R. Canetti, J. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in 45th FOCS (2004), pp. 186–195
3. LNCS;D. Beaver,1991
4. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in 20th STOC (1988), pp. 1–10
5. R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143–202 (2000)