Twisting Additivity in Program Obfuscation

Abstract : Additivity plays a key role in program analysis. It is the basis for designing Galois connection based abstract interpretations, it makes a Data-Flow Analysis (DFA) problem easy being convertible into a Kildall's general form, and provides a lattice-theoretic model for disjunctive analysis. In this paper we consider reversible transformers respectively making any monotone function additive and maximally non-additive. We show that, under non restrictive hypothesis, these transformers exist and that they provide a theoretical foundation for the obfuscation of DFA.
Type de document :
Communication dans un congrès
Information Systems, Technology and Management - 6th International Conference, ICISTM, 2012, Unknown, Springer, 285, pp.336-347, 2012, Communications in Computer and Information Science
Liste complète des métadonnées

https://hal.inria.fr/hal-00909387
Contributeur : Davide Sangiogi <>
Soumis le : mardi 26 novembre 2013 - 11:08:33
Dernière modification le : mardi 26 novembre 2013 - 11:08:33

Identifiants

  • HAL Id : hal-00909387, version 1

Citation

Mila Dalla Preda, Wu Feng, Roberto Giacobazzi, Richard Greechie, Arun Lakhotia. Twisting Additivity in Program Obfuscation. Information Systems, Technology and Management - 6th International Conference, ICISTM, 2012, Unknown, Springer, 285, pp.336-347, 2012, Communications in Computer and Information Science. 〈hal-00909387〉

Partager

Métriques

Consultations de la notice

29