Twisting Additivity in Program Obfuscation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Twisting Additivity in Program Obfuscation

Mila Dalla Preda
  • Fonction : Auteur
Wu Feng
  • Fonction : Auteur
Roberto Giacobazzi
  • Fonction : Auteur
  • PersonId : 933829
Richard Greechie
  • Fonction : Auteur
Arun Lakhotia
  • Fonction : Auteur

Résumé

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.

Domaines

Informatique
Fichier non déposé

Dates et versions

hal-00909387 , version 1 (26-11-2013)

Identifiants

  • HAL Id : hal-00909387 , version 1

Citer

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, pp.336-347. ⟨hal-00909387⟩
5 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More