Lossy Trapdoor Functions
634
35.2
Microsoft Research330 тыс
Следующее
12.08.16 – 561:44:11Популярные
125 дней – 1 6895:12
331 день – 5671:03:57Опубликовано 12 августа 2016, 0:31
Lossy Trapdoor Functions (LTFs) were introduced by Peikert and Waters in STOC '08, and since that time they have become an extremely useful cryptographic primitive. Lossy Trapdoor Functions yield simple constructions of pseudorandom generators, collision resistant hash functions, IND-CCA secure cryptosystems, deterministic encryption, leaky pseudoentropy functions and more. In this talk, I'll show a number of new constructions of LTFs from a variety of cryptographic primitives and number theoretic assumptions. These constructions can be cast into two broad categories: exploiting (group) homomorphisms of common cryptosystems, and derandomizing randomized lossy primitives.
Свежие видео
12 дней – 5887:37
14 дней – 3 2481:17
18 дней – 6 83737:18
19 дней – 5351:29
19 дней – 5 6913:33
Случайные видео
63 дня – 2 3070:34
04.02.23 – 179 0998:49
09.08.22 – 2520:56
13.07.22 – 3 7360:19
04.03.21 – 36 84510:35
24.10.14 – 263 22910:36
7 дней – 3 4730:30
9 дней – 10 6540:15
11 дней – 369 5119:22
13 дней – 1 5630:45
15 дней – 8 6360:16
16 дней – 24 9685:20
17 дней – 5471:07