Randomness Complexity of Private Circuits for Multiplication

Name: Randomness Complexity of Private Circuits for Multiplication
Uploaded: 2016-01-01
Duration: 19 min 46 s
Description: Randomness Complexity of Private Circuits for Multiplication — a 2016 Eurocrypt 2016 security conference talk on crypto (19:46 min). Watch the full video, indexed free on the Breach Arc Archive.

Eurocrypt 2016 · 2016 · 19:46

▶

Randomness Complexity of Private Circuits for Multiplication — a 2016 Eurocrypt 2016 security conference talk on crypto (19:46 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

crypto

← Back to the Breach Arc Archive