Addressing Intractable Optimization and Verification Problems in Access Control
124
Microsoft Research330 тыс
Следующее
27.07.16 – 1961:29:35Популярные
149 дней – 3 5578:50
249 дней – 3 9895:35Опубликовано 27 июля 2016, 0:59
Access control deals with regulating the accesses principals have to resources, and is an important aspect of security. Intractable (NP-hard) problems arise frequently in access control. In this talk, I will discuss three such problems. Two are multi-dimensional optimization problems that arise in the context of access-enforcement, and the third is a policy-verification problem. I will discuss the manner in which we have addressed the intractability of each using well-founded techniques, particularly the use of constraint-solvers augmented with domain-knowledge. (This is joint work with Nima Mousavi and Vijay Ganesh of the University of Waterloo, Karthick Jayaraman of Microsoft, Martin Rinard of MIT, and Steve Chapin of Syracuse University.)
Свежие видео
5 дней – 3 8611:56
8 дней – 8 22210:14
8 дней – 1 075 5600:58
12 дней – 1181:52
23 дня – 1 057 0598:21Случайные видео
263 дня – 489 81442:35
21.04.23 – 113 9313:28
25.02.23 – 808 4304:03:57
05.10.22 – 8502:30
16.03.22 – 9471:15
12.06.21 – 125 40926:51
1 день – 8790:21
2 дня – 956 7020:39
2 дня – 2 0840:16
3 дня – 79 36524:01
3 дня – 17 8541:59
4 дня – 1 394 10931:29
9 дней – 1 9031:00
2 дня – 1 06442:38