Twisting Additivity in Program Obfuscation

  • Mila Dalla Preda
  • Wu Feng
  • Roberto Giacobazzi
  • Richard Greechie
  • Arun Lakhotia
Conference paper

DOI: 10.1007/978-3-642-29166-1_30

Part of the Communications in Computer and Information Science book series (CCIS, volume 285)
Cite this paper as:
Dalla Preda M., Feng W., Giacobazzi R., Greechie R., Lakhotia A. (2012) Twisting Additivity in Program Obfuscation. In: Dua S., Gangopadhyay A., Thulasiraman P., Straccia U., Shepherd M., Stein B. (eds) Information Systems, Technology and Management. ICISTM 2012. Communications in Computer and Information Science, vol 285. Springer, Berlin, Heidelberg

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.

Keywords

Program analysis distributive DFA framework code obfuscation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Mila Dalla Preda
    • 1
  • Wu Feng
    • 2
  • Roberto Giacobazzi
    • 3
  • Richard Greechie
    • 2
  • Arun Lakhotia
    • 4
  1. 1.University of BolognaBolognaItaly
  2. 2.Louisiana Tech UniversityRustonUSA
  3. 3.University of VeronaVeronaItaly
  4. 4.University of LouisianaLafayetteUSA

Personalised recommendations