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

Name: On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation
Uploaded: 2020-01-01
Duration: 28 min 9 s
Description: On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation — a 2020 Asiacrypt 2020 security conference talk on crypto (28:09 min). Watch the full video, indexed free on the Breach Arc Archive.

Asiacrypt 2020 · 2020 · 28:09

▶

On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation — a 2020 Asiacrypt 2020 security conference talk on crypto (28:09 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

crypto

← Back to the Breach Arc Archive