Using Extensions of Min-Entropy to Help with Key Agreement and Leakage Resilience
280
Microsoft Research330 тыс
Следующее
17.08.16 – 2 8611:19:44Популярные
07.12.22 – 39330:51
28.11.22 – 60629:46Опубликовано 17 августа 2016, 2:43
There are many different notions of information-theoretic entropy and its computational analogues. The right notion and a toolbox of lemmas can make for beautifully simple proofs. Drawing on examples from information-theoretic key agreement and leakage-resilient cryptography (no background in either is assumed), I will show how various extensions of min-entropy can help analyze cryptographic constructions. I will also present some (not always well-formed) open problems.
Свежие видео
12 часов – 6 6742:46
4 дня – 4760:35
6 дней – 1 660 10431:29
6 дней – 6000:45
Случайные видео
140 дней – 4 835 6412:58
201 день – 9 3730:53
18.07.23 – 6 5599:00
09.03.23 – 2 83117:53
19.01.22 – 1 1366:22
02.02.18 – 23 1640:40
5 дней – 105 27724:01
6 дней – 4433:31
8 дней – 1721:52
15 дней – 22613:16
20 дней – 92848:11
20 дней – 16 7211:54