Twisting Additivity in Program Obfuscation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Twisting Additivity in Program Obfuscation

Mila Dalla Preda
  • Function : Author
Wu Feng
  • Function : Author
Roberto Giacobazzi
  • Function : Author
  • PersonId : 933829
Richard Greechie
  • Function : Author
Arun Lakhotia
  • Function : Author

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-00909387 , version 1

Cite

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⟩
22 View
0 Download

Share

Gmail Facebook X LinkedIn More