Author of the publication

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

Broadcast Extensions with Optimal Communication and Round Complexity., and . PODC, page 371-380. ACM, (2016)Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited., , and . PODC, page 295-304. ACM, (2018)Brief announcement: communication efficient asynchronous byzantine agreement., and . PODC, page 243-244. ACM, (2010)Adaptively Secure Computation with Partial Erasures., , and . PODC, page 291-300. ACM, (2015)Fast Secure Computation for Small Population over the Internet., , , and . CCS, page 677-694. ACM, (2018)Asynchronous Multiparty Computation with Linear Communication Complexity., , and . DISC, volume 8205 of Lecture Notes in Computer Science, page 388-402. Springer, (2013)Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity., , and . PODC, page 245-246. ACM, (2010)Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network., , and . ICITS, volume 10681 of Lecture Notes in Computer Science, page 83-109. Springer, (2017)Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary., , and . ACNS, volume 6715 of Lecture Notes in Computer Science, page 292-308. (2011)Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience., and . ICITS, volume 6673 of Lecture Notes in Computer Science, page 206-226. Springer, (2011)