Efficient Oblivious Automata Evaluation and Its Application
111
Microsoft Research330 тыс
Следующее
17.08.16 – 2411:07:01Популярные
339 дней – 2121:06
13.02.23 – 1 4041:27:52Опубликовано 17 августа 2016, 3:25
Oblivious Automata Evaluation allows two parties -a client who holds an input string X and a server who holds an Automata G- to learn the result of evaluating G on X but nothing else. In this talk, I will describe a simple and efficient, secure two-party construction for this problem. I will also explain some applications of our construction to pattern matching and intrusion detection. Finally, I report on the results of some experiments based on a prototype implementation. Joint work with Salman Niksefat and Saeed Sadeghian.
Свежие видео
10 дней – 25218:22
11 дней – 9110:31
11 дней – 6880:41
12 дней – 5 75230:31
13 дней – 3 1761:17Случайные видео
46 дней – 1 7290:36
362 дня – 29 8610:30
03.02.23 – 39 77343:29
16.08.21 – 52 0528:58
25.04.21 – 49 0477:14
10.09.11 – 30 4722:59
3 дня – 1370:58
6 дней – 6746:24
6 дней – 3 6620:17
9 дней – 5481:13
