Specifying imperative data obfuscations

Authors:
Stephen Drape;Clark Thomborson;Anirban Majumdar
Affiliations:
Department of Computer Science, The University of Auckland, New Zealand;Department of Computer Science, The University of Auckland, New Zealand;Department of Computer Science, The University of Auckland, New Zealand
Venue:
ISC'07 Proceedings of the 10th international conference on Information Security
Year:
2007

Citing 6
Cited 3

Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Manufacturing cheap, resilient, and stealthy opaque constructs

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transforming the .NET intermediate language using path logic programming

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
On the (Im)possibility of Obfuscating Programs

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Protection of Software-Based Survivability Mechanisms

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Data Refinement: Model-Oriented Proof Methods and their Comparison

Data Refinement: Model-Oriented Proof Methods and their Comparison

Creating Transformations for Matrix Obfuscation

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Obfuscation by partial evaluation of distorted interpreters

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Making abstract interpretation incomplete: modeling the potency of obfuscation

SAS'12 Proceedings of the 19th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

An obfuscation aims to transform a program, without affecting the functionality, so that some secret information within the program can be hidden for as long as possible from an adversary. Proving that an obfuscating transform is correct (i.e. it preserves functionality) is considered to be a challenging task. In this paper we show how data refinement can be used to specify imperative data obfuscations. An advantage of this approach is that we can establish a framework in which we can prove the correctness of our obfuscations. We demonstrate our framework by considering some examples from obfuscation literature. We show how to specify these obfuscations, prove that they are correct and produce generalisations.