|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 listsCentre for Commonwealth Education (CCE) Workshop on Multimodal Approaches to Language Acquisition Faculty of Asain and Middle Eastern Studies
Other talksOncogenes and tumour suppressors (signalling and pathways) Empirical Models of Galaxy Formation - Constraints and Predictions Planar and outer membrane polarity in the Arabidopsis root epidermis FsLab: Doing data science with F# Conservation of reef sharks in Arabia: between science and fisherman gossip 2D or not 2D? Two-dimensional nanostructures for sensing and solar energy conversion