Defeating MBA-based Obfuscation - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Defeating MBA-based Obfuscation


Mixed Boolean-Arithmetic expressions are presented as a strong protection in the context of data flow obfuscation. As there is very little literature on the analysis of such obfus-cated expressions, two important subjects of interest are: to define what simplifying those expressions means, and how to design a simplification solution. We focus on evaluating the resilience of this technique, by giving theoretical elements to justify its efficiency and proposing a simplification algorithm using a pattern matching approach. The implementation of this solution is capable of simplifying the public examples of MBA-obfuscated expressions, demonstrating that at least a subset of MBA obfuscation lacks resilience against pattern matching analysis.
Fichier principal
Vignette du fichier
spro05.pdf (424.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01388109 , version 1 (26-10-2016)



Ninon Eyrolles, Louis Goubin, Marion Videau. Defeating MBA-based Obfuscation. 2nd International Workshop on Software PROtection, Oct 2016, Vienna, Austria. ⟨10.1145/2995306.2995308⟩. ⟨hal-01388109⟩
397 View
1935 Download



Gmail Facebook X LinkedIn More