1. Asynchronous MPC with a strict honest majority using non-equivocation
2. Z.
Beerliová-Trubíniová
and
M.
Hirt
.
Efficient multi-party computation with dispute control. In S. Halevi and T. Rabin editors Theory of Cryptography Third Theory of Cryptography Conference TCC
2006 New York NY USA March 4-7 2006 Proceedings volume
3876
of
Lecture Notes in Computer Science pages
305
--
328
.
Springer Verlag 2006. 10.1007/11681878_16 Z. Beerliová-Trubíniová and M. Hirt. Efficient multi-party computation with dispute control. In S. Halevi and T. Rabin editors Theory of Cryptography Third Theory of Cryptography Conference TCC 2006 New York NY USA March 4-7 2006 Proceedings volume 3876 of Lecture Notes in Computer Science pages 305--328. Springer Verlag 2006. 10.1007/11681878_16
3. Z.
Beerliová-Trubíniová
and
M.
Hirt
.
Perfectly-Secure MPC with Linear Communication Complexity. In R. Canetti editor Theory of Cryptography Fifth Theory of Cryptography Conference TCC
2008 New York USA March 19-21 2008 volume
4948
of
Lecture Notes in Computer Science pages
213
--
230
.
Springer Verlag 2008. 10.1007/978-3-540-78524-8_13 Z. Beerliová-Trubíniová and M. Hirt. Perfectly-Secure MPC with Linear Communication Complexity. In R. Canetti editor Theory of Cryptography Fifth Theory of Cryptography Conference TCC 2008 New York USA March 19-21 2008 volume 4948 of Lecture Notes in Computer Science pages 213--230. Springer Verlag 2008. 10.1007/978-3-540-78524-8_13
4. Asynchronous secure computation