SuperLectures.com

IS MULTIPARTY COMPUTATION ANY GOOD IN PRACTICE?

Secure Signal Processing

Full Paper at IEEE Xplore

Presented by: Claudio Orland, Author(s): Claudio Orlandi, Aarhus University, Denmark

The aim of this paper is to present some of the recent progress in emph{efficient} secure multiparty computation (MPC). In MPC we have a set of parties owning a set of private inputs. The parties want to compute a function of their inputs, but they do not trust each other, therefore they need a cryptographic protocol to perform the computation in a way that 1) the output is correct and 2) cheating parties will not be able to learn any information about the honest parties inputs. Even though this problem has been formulated and essentially solved almost 30 years ago, practical solutions that can be relevant for real-world applications have been discovered only in the last few years. We will present some of these advances, trying to explain to a non-specialized audience the significance of the several existing security notions.


  Speech Transcript

|

  Slides

Enlarge the slide | Show all slides in a pop-up window

0:00:16

  1. slide

0:00:25

  2. slide

0:00:59

  3. slide

0:01:19

  4. slide

0:01:26

  5. slide

0:01:52

  6. slide

0:02:32

  7. slide

0:03:16

  8. slide

0:04:30

  9. slide

0:05:12

 10. slide

0:06:07

 11. slide

0:08:07

 12. slide

0:08:14

 13. slide

0:08:33

 14. slide

0:09:41

 15. slide

0:09:49

 16. slide

0:10:46

 17. slide

0:11:40

 18. slide

0:12:35

 19. slide

0:13:14

 20. slide

0:14:53

 21. slide

0:15:16

 22. slide

0:15:31

 23. slide

0:16:00

 24. slide

0:16:09

 25. slide

0:16:41

 26. slide

0:17:07

 27. slide

0:17:16

 28. slide

  Comments

Please sign in to post your comment!

  Lecture Information

Recorded: 2011-05-25 16:15 - 16:35, Club D
Added: 20. 6. 2011 00:47
Number of views: 19
Video resolution: 1024x576 px, 512x288 px
Video length: 0:24:04
Audio track: MP3 [8.16 MB], 0:24:04