Mostrar el registro sencillo del ítem

dc.contributor.authorTorre Macías, Juan Carlos de la 
dc.contributor.authorJareño Dorado, Javier 
dc.contributor.authorAragón Jurado, José Miguel 
dc.contributor.authorVarrette, Sébastien
dc.contributor.authorDorronsoro Díaz, Bernabé 
dc.contributor.otherIngeniería Informáticaes_ES
dc.date.accessioned2024-05-21T07:31:53Z
dc.date.available2024-05-21T07:31:53Z
dc.date.issued2024-05-14
dc.identifier.urihttp://hdl.handle.net/10498/32296
dc.description.abstractWith the advent of the cloud computing model allowing a shared access to massive computing facilities, a surging demand emerges for the protection of the intellectual property tied to the programs executed on these uncontrolled systems. If novel paradigm as confidential computing aims at protecting the data manipulated during the execution, obfuscating techniques (in particular at the source code level) remain a popular solution to conceal the purpose of a program or its logic without altering its functionality, thus preventing reverse-engineering on the program even with the help of computing resources. The many advantages of code obfuscation, together with its low cost, makes it a popular technique. This paper proposes a novel methodology for source code obfuscation that can be used together with other traditional obfuscation techniques, making the code more robust against reverse engineering attacks. Three program complexity metrics are used to define three different single-objective combinatorial optimization versions of the problem, which are solved and analysed. Additionally, three multi-objective problems are defined, those considering each of the selected metrics together with the program execution time, in order to avoid strong obfuscations penalizing the performance. The goal of the defined problems is to find sequences of LLVM optimizations that lead to highly obfuscated versions of the original code. These transformations are applied to the back-end pseudo-assembly code (i.e., LLVM Intermediate Representation), thus avoiding any further optimizations by the compiler. Classical genetic algorithms (GAs) are used to solve the studied problems, namely a basic cellular GA for the single-objective problems and the popular NSGA-II for the multi-objective ones. The promising results show the potential of the proposed technique.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherOxford Universityes_ES
dc.subjectSource code obfuscationes_ES
dc.subjectLLVMes_ES
dc.subjectIntermediate representationes_ES
dc.subjectGenetic algorithmses_ES
dc.subjectMulti-objective optimizationes_ES
dc.titleSource code obfuscation with genetic algorithms using LLVM code optimizationses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doihttps://doi.org/10.1093/jigpal/jzae069
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI//PID2022-137858OB-I00es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI//TED2021-131880B-I00es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-109465RB-I00/ES/SISTEMAS NEUROMORFICOS PARA VISION ARTIFICIAL/ es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/MICINN//FPU21%2F02026 es_ES
dc.type.hasVersionVoRes_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem