BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Science and Engineering - ECPv6.13.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computer Science and Engineering
X-ORIGINAL-URL:https://homecse.iitd.ac.in
X-WR-CALDESC:Events for Computer Science and Engineering
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20260101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260316T120000
DTEND;TZID=Asia/Kolkata:20260316T130000
DTSTAMP:20261010T135923
CREATED:20260312T134932Z
LAST-MODIFIED:20260312T134932Z
UID:2437-1773662400-1773666000@homecse.iitd.ac.in
SUMMARY:Logical explorations for security theory by Prof. Vaishnavi Sundararajan
DESCRIPTION:Venue: Bharti 501 \nAbstract: Logics and proof theories play a large role in the formal study and analysis of systems\, especially for formal verification. The exact shape of the syntax and proof rules involved depend heavily on the systems being modelled and verified. In this talk\, we will introduce a logical syntax for communicated messages and an associated proof system originally used in the verification of cryptographic protocols\, dating back to a very robust model from 1983\, which captures even the operational aspects of today’s internet. We will show how to extend thissystem to be able to better handle protocols that involve the communication of certificates\, and investigate some of the various logical and algorithmic questions that manifest during this endeavour.
URL:https://homecse.iitd.ac.in/event/logical-explorations-for-security-theory-by-prof-vaishnavi-sundararajan/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
END:VEVENT
END:VCALENDAR