Towards more Practical Secure Computation: Efficient Protocols for Secure Linear Algebra [1/2]
71
Microsoft Research330 тыс
Следующее
06.09.16 – 35147:22Популярные
58 дней – 61154:23
06.12.22 – 49627:07Опубликовано 6 сентября 2016, 18:33
Secure Computation has been a classic and central question in modern cryptography with a large set of potential applications. Mining large genomic databases, private scientific computation, and studying properties of shared networks are just a few examples. Unfortunately, the majority of the constructions in this area have not made their way into practice, primarily due to their inefficiency. In this talk, I first outline three different approaches toward designing more practical protocols, and briefly describe some of our results in each direction. I will then focus on one approach and the problem of Secure
Свежие видео
9 дней – 119 94114:59
11 дней – 5981:43
17 дней – 1 51811:50
18 дней – 16 5171:54
19 дней – 1 2950:58
20 дней – 35 5411:29Случайные видео
7 дней – 3 0170:30
50 дней – 150 4354:49
307 дней – 6 7500:48
349 дней – 8 1020:18
16.10.22 – 700 1231:54:18
4 дня – 3612:49
4 дня – 1550:44
5 дней – 4 3921:43:16
11 дней – 25218:22
11 дней – 47522:13
11 дней – 9370:20
8 дней – 546 8803:00