Media Summary: Talk by Divya Ravi, Luisa Siniscalchi and Sophia Yakoubov at TPMPC 2022. Paper by Ran Cohen, Juan Garay, Vassilis Zikas presented at Eurocrypt 2020 See ... Paper by Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov presented at Crypto 2021 See ...

Broadcast Optimal Two Round Mpc - Detailed Analysis & Overview

Talk by Divya Ravi, Luisa Siniscalchi and Sophia Yakoubov at TPMPC 2022. Paper by Ran Cohen, Juan Garay, Vassilis Zikas presented at Eurocrypt 2020 See ... Paper by Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov presented at Crypto 2021 See ... Paper by Aarushi Goel Rajeev Raghunath, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath presented at TCC 2021 See ... Daniel Wichs, Northeastern University Securing Computation Divya Ravi (University of Amsterdam) Secure ...

Benny Applebaum (Tel Aviv Univ.); Eliran Kachlon (Tel Aviv Univ.); Arpita Patra (IIS, Bangalore) Talk by James Bartusek at TPMPC 2020. Paper available at Paper by Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan presented at Crypto 2021 See ... Paper by Arpita Patra, Divya Ravi, Swati Singla presented at Asiacrypt 2020 See ... Paper by Arpita Patra, Akshayaram Srinivasan presented at Crypto 2021 See ...

Photo Gallery

Broadcast-Optimal Two-Round MPC with an Honest Majority
Broadcast-Optimal Two-Round MPC
Broadcast-Optimal Two Round MPC with an Honest Majority
On Communication Models and Best-Achievable Security in Two-Round MPC
Two Round MPC via Multi-Key FHE
Asynchronous & Broadcast-Efficient MPC
Broadcast Optimal Multi-Party Computation
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency
Reusable Two Round MPC from DDH
On the Round Complexity of Black-Box Secure MPC
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation
s-144: Multi-Party Computation 2
View Detailed Profile
Broadcast-Optimal Two-Round MPC with an Honest Majority

Broadcast-Optimal Two-Round MPC with an Honest Majority

Talk by Divya Ravi, Luisa Siniscalchi and Sophia Yakoubov at TPMPC 2022.

Broadcast-Optimal Two-Round MPC

Broadcast-Optimal Two-Round MPC

Paper by Ran Cohen, Juan Garay, Vassilis Zikas presented at Eurocrypt 2020 See ...

Broadcast-Optimal Two Round MPC with an Honest Majority

Broadcast-Optimal Two Round MPC with an Honest Majority

Paper by Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov presented at Crypto 2021 See ...

On Communication Models and Best-Achievable Security in Two-Round MPC

On Communication Models and Best-Achievable Security in Two-Round MPC

Paper by Aarushi Goel Rajeev Raghunath, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath presented at TCC 2021 See ...

Two Round MPC via Multi-Key FHE

Two Round MPC via Multi-Key FHE

Daniel Wichs, Northeastern University Securing Computation http://simons.berkeley.edu/talks/daniel-wichs-2015-06-12.

Asynchronous & Broadcast-Efficient MPC

Asynchronous & Broadcast-Efficient MPC

Broadcast

Broadcast Optimal Multi-Party Computation

Broadcast Optimal Multi-Party Computation

Divya Ravi (University of Amsterdam) https://simons.berkeley.edu/talks/divya-ravi-university-amsterdam-2025-08-05 Secure ...

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

Benny Applebaum (Tel Aviv Univ.); Eliran Kachlon (Tel Aviv Univ.); Arpita Patra (IIS, Bangalore)

Reusable Two Round MPC from DDH

Reusable Two Round MPC from DDH

Talk by James Bartusek at TPMPC 2020. Paper available at https://eprint.iacr.org/2020/170.

On the Round Complexity of Black-Box Secure MPC

On the Round Complexity of Black-Box Secure MPC

Paper by Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan presented at Crypto 2021 See ...

On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation

On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation

Paper by Arpita Patra, Divya Ravi, Swati Singla presented at Asiacrypt 2020 See ...

s-144: Multi-Party Computation 2

s-144: Multi-Party Computation 2

...

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Paper by Arpita Patra, Akshayaram Srinivasan presented at Crypto 2021 See ...