Lecture notes in computer science

On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions

Ran Canetti, Eyal Kushilevitz Z, Yehuda Lindell

Published Jan 1, 2003• 167 citations

Related papers

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

Ran Canetti, Eyal Kushilevitz Z, Yehuda Lindell

Universally-Composable Two-Party Computation in Two Rounds

Omer Horvitz, Jonathan I. Katz

Universally Composable Multiparty Computation with Partially Isolated Parties

Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs

4. Universally Composable Multi-party Computation

Yehuda Lindell

Universally Composable Multi-party Computation Using Tamper-Proof Hardware

Jonathan I. Katz

Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) Assumptions

Brandon Broadnax, Jeremias Mechler, Jörn Müller‐Quade