Context:
Code hardening is meant to fight malicious tampering with sensitive code executed on client hosts.
Code splitting is a hardening technique that moves selected chunks of code from client to server.
Although widely adopted, the effective benefits of code splitting are not fully understood and thoroughly assessed.
Goal:
The objective of this work is to compare non protected code vs. code splitting protected code, considering two levels of the chunk size parameter, in order to assess the effectiveness of the protection - in terms of both attack time and success rate - and to understand the attack strategy and process used to overcome the protection.
Method:
We conducted an experiment with master students performing attack tasks on a small application hardened with different levels of protection. Students carried out their task working at the source code level.
Results:
We observed a statistically significant effect of code splitting on the attack success rate that, on the average, was reduced from 89% with unprotected clear code to 52% with the most effective protection.
The protection variant that moved some small-sized code chunks turned out to be more effective than the alternative moving fewer but larger chunks.
Different strategies were identified yielding different success rates. Moreover we discovered that successful attacks exhibited different process w.r.t. failed ones.
Conclusions:
We found empirical evidence of the effect of code splitting, assessed the relative magnitude, and evaluated the influence of the chunk size parameter. Moreover we extracted the process used to overcome such obfuscation technique.