Author of the publication

Perfectly-Secure MPC with Linear Communication Complexity.

, and . TCC, volume 4948 of Lecture Notes in Computer Science, page 213-230. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficient multi-party computation with information-theoretic security.. ETH Zurich, Zürich, Switzerland, (2008)base-search.net (ftethz:oai:www.research-collection.ethz.ch:20.500.11850/72802).On the theoretical gap between synchronous and asynchronous MPC protocols., , and . PODC, page 211-218. ACM, (2010)Perfectly-Secure MPC with Linear Communication Complexity., and . TCC, volume 4948 of Lecture Notes in Computer Science, page 213-230. Springer, (2008)Simple and Efficient Perfectly-Secure Asynchronous MPC., and . ASIACRYPT, volume 4833 of Lecture Notes in Computer Science, page 376-392. Springer, (2007)Efficient Multi-party Computation with Dispute Control., and . TCC, volume 3876 of Lecture Notes in Computer Science, page 305-328. Springer, (2006)Efficient Byzantine Agreement with Faulty Minority., , and . ASIACRYPT, volume 4833 of Lecture Notes in Computer Science, page 393-409. Springer, (2007)