Description
By interpreting terms as distributions over strings, Abadi and Rogaway proved under suitable assumptions that indistinguishability in the computational setting, accepted as the impossibility for an observer to acquire knowledge from observing a protocol execution, is equivalent to formal equivalence in a symbolic setting. This result led to multiple results on “deciding knowledge” using static equivalence.
I will present how this equivalence between a real and a formal setting can be leveraged to synthesize an anomaly detection system that constructs a monitor learned by observing the real traffic in a network.
Prochains exposés
-
Should I trust or should I go? A deep dive into the (not so reliable) web PKI trust model
Orateur : Romain Laborde - University of Toulouse
The padlock shown in the URL bar of our favorite web browser indicates that we are connected using a secure HTTPS connection and providing some sense of security. Unfortunately, the reality is slightly more complex. The trust model of the underlying Web PKI is invalid, making TLS a colossus with feet of clay. In this talk, we will dive into the trust model of the web PKI ecosystem to understand[…]-
SoSysec
-
Protocols
-
Network
-