SuperLectures.com

IS MULTIPARTY COMPUTATION ANY GOOD IN PRACTICE?

Full Paper at IEEE Xplore

Secure Signal Processing

Přednášející: Claudio Orland, Autoři: 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.


  Přepis řeči

|

  Slajdy

Zvětšit slajd | Zobrazit všechny slajdy

0:00:16

  1. slajd

0:00:25

  2. slajd

0:00:59

  3. slajd

0:01:19

  4. slajd

0:01:26

  5. slajd

0:01:52

  6. slajd

0:02:32

  7. slajd

0:03:16

  8. slajd

0:04:30

  9. slajd

0:05:12

 10. slajd

0:06:07

 11. slajd

0:08:07

 12. slajd

0:08:14

 13. slajd

0:08:33

 14. slajd

0:09:41

 15. slajd

0:09:49

 16. slajd

0:10:46

 17. slajd

0:11:40

 18. slajd

0:12:35

 19. slajd

0:13:14

 20. slajd

0:14:53

 21. slajd

0:15:16

 22. slajd

0:15:31

 23. slajd

0:16:00

 24. slajd

0:16:09

 25. slajd

0:16:41

 26. slajd

0:17:07

 27. slajd

0:17:16

 28. slajd

  Komentáře

Please sign in to post your comment!

  Informace o přednášce

Nahráno: 2011-05-25 16:15 - 16:35, Club D
Přidáno: 20. 6. 2011 00:47
Počet zhlédnutí: 19
Rozlišení videa: 1024x576 px, 512x288 px
Délka videa: 0:24:04
Audio stopa: MP3 [8.16 MB], 0:24:04