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

On the Bottleneck Complexity of MPC with Correlated Randomness., , and . IACR Cryptol. ePrint Arch., (2021)sfAsterisk: Super-fast MPC with a Friend., , , , , and . IACR Cryptol. ePrint Arch., (2023)Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels., , , and . LATINCRYPT, volume 14168 of Lecture Notes in Computer Science, page 87-106. Springer, (2023)Broadcast-Optimal Four-Round MPC in the Plain Model., , , , , and . TCC (2), volume 14370 of Lecture Notes in Computer Science, page 3-32. Springer, (2023)Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network., , and . IACR Cryptology ePrint Archive, (2017)Minimizing Setup in Broadcast-Optimal Two Round MPC., , , and . IACR Cryptol. ePrint Arch., (2022)On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation., , and . ASIACRYPT (3), volume 12493 of Lecture Notes in Computer Science, page 60-91. Springer, (2020)Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)., , , , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 55-71. Springer, (2018)On the Exact Round Complexity of Secure Three-Party Computation., and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 425-458. Springer, (2018)On the Exact Round Complexity of Secure Three-Party Computation., and . J. Cryptol., 34 (4): 40 (2021)