|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Distance bounding protocols: Authentication logic analysis
If you have a question about this talk, please contact Saar Drimer.
Note unusual room, day and hour
The analysis of cryptographic protocols is by now a well established application area for formal methods. However, there are many protocols that go beyond the traditional Dolev-Yao model for which these formal methods have been developed. In this talk we examine a particular class of such protocols, distance bounding protocols, designed to authenticate distance measurements in sensor networks. These rely not only on assumptions about the soundness of cryptographic functions, but on physical assumptions about the time of flight of signals. We adapt the authentication logic of Pavlovic, Meadows, and Cervesato to reason about these protocols by incorporating the physical assumptions necessary as axioms and definitions in the system, and apply it to the analysis of a family of distance bounding protocols. We also discuss the potential for adding probabilistic reasoning to the logic to better capture the necessary physical assumptions.
This talk is part of the Computer Laboratory Security Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCambridge Interdisciplinary Performance Network Lucy Cavendish College Visiting Scholar Seminars
Other talks“Learning Through Crowdfunding” Workshop: 'The development and facilitation of an emotion and memory group programme for the treatment of complex PTSD' Group Discussions (Isaac Newton Institute & Centre for Mathematical Sciences) 70th Anniversary Celebration Research Conference and Showcase - Research and Practice: Making the connections 'Poetry and memory: investigating the value of the memorised poem'