Tamper-proofing basis path by using oblivious hashing on Java

Authors:
Hsiang-Yang Chen;Ting-Wei Hou;Chun-Liang Lin
Affiliations:
National Cheng Kung University, Taiwan, Republic of China;National Cheng Kung University, Taiwan, Republic of China;National Cheng Kung University, Taiwan, Republic of China
Venue:
ACM SIGPLAN Notices
Year:
2007

Citing 8
Cited 0

Architectural support for copy and tamper resistant software

ACM SIGPLAN Notices
Watermarking, tamper-proffing, and obfuscation: tools for software protection

IEEE Transactions on Software Engineering
Oblivious Hashing: A Stealthy Software Integrity Verification Primitive

IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Discouraging Software Piracy Using Software Aging

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
Preventing Piracy, Reverse Engineering, and Tampering

Computer
Securing Java through software watermarking

PPPJ '03 Proceedings of the 2nd international conference on Principles and practice of programming in Java
Advanced obfuscation techniques for Java bytecode

Journal of Systems and Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

Java programs are often downloaded (distributed) to unknown environments, so protect Java code from malicious modification is an important issue. This paper presents a tamper-proofing software technology on basis paths for stack-machine based languages, such as Java, by improving Oblivious Hashing. Our approach is based on a new dynamic stack-tracing approach which inserts hash instructions to monitor the top of the stack to check whether the program running has been tampered with or not. A user can choose one or more methods in a class to tamper-proof program. The protective codes are added to basic blocks at the bytecode level. We developed a new approach to protect constants and variables by alternative hashing functions. The overhead is proportional to the number of Load and Push instructions to be protected.