Round-Efficient Secure Computation

How much back-and-forth interaction is needed for mutually distrustful parties to compute together securely? My work established round-efficient protocols and compilers, with an emphasis on black-box constructions and security against malicious participants.

Round Optimal Black-Box MPC in the Plain Model
with Yuval Ishai, Amit Sahai and Akshayaram Srinivasan.
(CRYPTO 2023)
Round Optimal Black-Box Protocol Compilers
with Yuval Ishai, Amit Sahai and Akshayaram Srinivasan.
(EUROCRYPT 2022)
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT
with Yuval Ishai, Amit Sahai and Akshayaram Srinivasan.
(TCC 2022)

Round-Efficient Secure Computation

Related papers