Table of contents

  • This session has been presented September 13, 2024 (11:00 - 12:00).

Description

  • Speaker

    Yannick Chevalier - Université de Toulouse

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.

Next sessions

  • Tackling obfuscated code through variant analysis and Graph Neural Networks

    • March 21, 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - - Petri/Turing room

    Speaker : Roxane Cohen and Robin David - Quarkslab

    Existing deobfuscation techniques usually target specific obfuscation passes and assume a prior knowledge of obfuscated location within a program. Also, some approaches tend to be computationally costly. Conversely, few research consider bypassing obfuscation through correlation of various variants of the same obfuscated program or a clear program and a later obfuscated variant. Both scenarios are[…]
    • Malware analysis

    • Binary analysis

    • Obfuscation

Show previous sessions