Description
The applied pi-calculus is a powerful framework to model protocols and to define security properties. In this symbolic model, it is possible to verify automatically complex security properties such as strong secrecy, anonymity and unlinkability properties which are based on equivalence of processes.
In this talk, we will see an overview of a verification method used by a tool, Akiss. The tool is able to handle ?- a wide range of cryptographic primitives (in particular AKISS is the only tool able to verify equivalence properties for protocols that use xor); ?- protocols with else branches (the treatment of disequalities is often complicated). ?We will also provide some insights on how interleaving due to concurrency can be effectively handled.
Prochains exposés
-
Tackling obfuscated code through variant analysis and Graph Neural Networks
Orateur : 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
-