Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algorithms for White-Box Obfuscation Using Randomized Subcircuit Selection and Replacement

Algorithms for White-Box Obfuscation Using Randomized Subcircuit Selection and Replacement

Norman, Kenneth E.

Paperback

General EducationProgrammingComputer Security

ISBN10: 1288395728
ISBN13: 9781288395729
Publisher: Biblioscholar
Published: Dec 4 2012
Pages: 100
Weight: 0.33
Height: 0.21 Width: 6.14 Depth: 9.21
Language: English

Software protection remains an active research area with the goal of preventing adversarial software exploitation such as reverse engineering, tampering, and piracy. Heuristic obfuscation techniques lack strong theoretical underpinnings while current theoretical research highlights the impossibility of creating general, e cient, and information theoretically secure obfuscators. In this research, we consider a bridge between these two worlds by examining obfuscators based on the Random Program Model (RPM). Such a model envisions the use of program encryption techniques which change the black-box (semantic) and white-box (structural) representations of underlying programs. In this thesis we explore the possibilities for white-box transformation. Under an RPM formulation, if an adversary cannot distinguish an original program from either its obfuscated version (whose black-box behavior has been strategically altered) or a randomly generated program of comparable size, then the white-box intent of the original program has been su ciently protected.

Also in

General Education

View All