On the Exact Round Complexity of Self Composable Two Party Computation

Name: On the Exact Round Complexity of Self Composable Two Party Computation
Uploaded: 2017-01-01
Duration: 21 min 8 s
Description: On the Exact Round Complexity of Self Composable Two Party Computation — a 2017 Eurocrypt 2017 security conference talk on crypto (21:08 min). Watch the full video, indexed free on the Breach Arc Archive.

Eurocrypt 2017 · 2017 · 21:08

▶

On the Exact Round Complexity of Self Composable Two Party Computation — a 2017 Eurocrypt 2017 security conference talk on crypto (21:08 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

crypto

← Back to the Breach Arc Archive