Towards tamper resistant code encryption: practice and experience

Authors:
Jan Cappaert;Bart Preneel;Bertrand Anckaert;Matias Madou;Koen De Bosschere
Affiliations:
Katholieke Universiteit Leuven, Department of Electrical Engineering, ESAT, SCD, COSIC, Heverlee, Belgium;Katholieke Universiteit Leuven, Department of Electrical Engineering, ESAT, SCD, COSIC, Heverlee, Belgium;Universiteit Gent, Department of Electronics and Information Systems, ELIS-PARIS, Gent, Belgium;Universiteit Gent, Department of Electronics and Information Systems, ELIS-PARIS, Gent, Belgium;Universiteit Gent, Department of Electronics and Information Systems, ELIS-PARIS, Gent, Belgium
Venue:
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Year:
2008

Citing 14
Cited 5

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Writing Secure Code

Writing Secure Code
Tamper Resistant Software: An Implementation

Proceedings of the First International Workshop on Information Hiding
Oblivious Hashing: A Stealthy Software Integrity Verification Primitive

IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Dynamic Self-Checking Techniques for Improved Tamper Resistance

DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Protecting Software Code by Guards

DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
OCB: A block-cipher mode of operation for efficient authenticated encryption

ACM Transactions on Information and System Security (TISSEC)
Secure Programming Cookbook for C and C++

Secure Programming Cookbook for C and C++
Obfuscation of executable code to improve resistance to static disassembly

Proceedings of the 10th ACM conference on Computer and communications security
Hardware-Assisted Circumvention of Self-Hashing Software Tamper Resistance

IEEE Transactions on Dependable and Secure Computing
Strengthening Software Self-Checksumming via Self-Modifying Code

ACSAC '05 Proceedings of the 21st Annual Computer Security Applications Conference
Link-time compaction and optimization of ARM executables

ACM Transactions on Embedded Computing Systems (TECS)
On the infeasibility of modeling polymorphic shellcode

Proceedings of the 14th ACM conference on Computer and communications security
Delayed and controlled failures in tamper-resistant software

IH'06 Proceedings of the 8th international conference on Information hiding

A secure and robust approach to software tamper resistance

IH'10 Proceedings of the 12th international conference on Information hiding
Multi-stage binary code obfuscation using improved virtual machine

ISC'11 Proceedings of the 14th international conference on Information security
Replacement attacks against VM-protected applications

VEE '12 Proceedings of the 8th ACM SIGPLAN/SIGOPS conference on Virtual Execution Environments
An improved secure code encryption approach based on indexed table

Proceedings of the International Conference on Advances in Computing, Communications and Informatics
An efficient secure code approach based on indexed table quasi group encryption with Hadamard and Number Theoretic Transformation for software protection

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, many have suggested to apply encryption in the domain of software protection against malicious hosts. However, little information seems to be available on the implementation aspects or cost of the different schemes. This paper tries to fill the gap by presenting our experience with several encryption techniques: bulk encryption, an on-demand decryption scheme, and a combination of both techniques. Our scheme offers maximal protection against both static and dynamic code analysis and tampering. We validate our techniques by applying them on several benchmark programs of the CPU2006 Test Suite. And finally, we propose a heuristic which trades off security versus performance, resulting in a decrease of the runtime overhead.