BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.9//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:SECURITY & APPLIED LOGIC
X-ORIGINAL-URL:https://sal.cs.unibuc.ro
X-WR-CALDESC:Events for SECURITY & APPLIED LOGIC
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20190321T083000
DTEND;TZID=UTC:20190321T100000
DTSTAMP:20260406T121155
CREATED:20190318T053703Z
LAST-MODIFIED:20190318T053703Z
UID:381-1553157000-1553162400@sal.cs.unibuc.ro
SUMMARY:Verifying security protocols using BAN logic
DESCRIPTION:Speaker:   Alexandru Dragomir (University of Bucharest)  \n\nAbstract: Epistemic logics – logics aimed at reasoning about knowledge and belief – are widely considered to be suitable for modelling\, analyzing and predicting vulnerabilities of security protocols. One of the first and most discussed logical approaches to the problem of verifying security protocols is the one proposed in BAN logic (Burrows\, Abadi & Needham 1989)\, a many-sorted epistemic logic used for its intuitive and compelling set of inference rules devised for reasoning about an agent’s beliefs\, trust and message exchange. My presentation will focus on (1) briefly presenting the language and inference rules of BAN logic\, (2) offering a presentation of the Otway-Rees\, Needham-Schroeder and Kerberos protocols\, and (3) analysing the aforementioned protocols using BAN logic.
URL:https://sal.cs.unibuc.ro/event/verifying-security-protocols-using-ban-logic/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar
END:VEVENT
END:VCALENDAR