|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Is SSL provably secure ?
If you have a question about this talk, please contact Saar Drimer.
In this talk I will describe some joint work with P. Morrissey and B. Warinschi on the SSL protocol. We attempt to show that an abstraction of the SSL protocol does provide a secure key agreement protocol, and we quantify exactly what properties are required of any subprotocol which produces the pre-master secret.
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 listsIfM Buns Talk 5th Cambridge Assessment Conference: Challenges of assessment reform Phonetics & Phonology Research Cluster
Other talksInferno XVIII, Purgatorio XVIII, Paradiso XVIII Reliability Politics in Common in the Digital Age FsLab: Doing data science with F# Open Problems in Noisy Quantum Metrology Recent Theoretical Advances in the Control of Quantum Continuous Variables