| dc.contributor.author | WANG Yufang, LE Deguang, Jack TAN, XIAO Le, GONG Shengrong | |
| dc.contributor.other | 1 School of Computer Science and Technology,Soochow University,Suzhou,Jiangsu 215006,China ;2 School of Computer Science and Engineering,Changshu Institute of Technology,Suzhou,Jiangsu 215500,China ;3 Department of Computer Science,University of Wisconsin-Eau Claire,Eau Claire,Wisconsin 54701,USA | |
| dc.date.accessioned | 2025-08-27T02:34:14Z | |
| dc.date.accessioned | 2025-10-08T08:24:05Z | |
| dc.date.available | 2025-10-08T08:24:05Z | |
| dc.date.issued | 01-08-2023 | |
| dc.identifier.uri | http://digilib.fisipol.ugm.ac.id/repo/handle/15717717/35752 | |
| dc.description.abstract | Combined with opaque predicate,control flow obfuscation enables semantics-preserving transformations,which can achieve the purpose of code protection.However,existing opaque predicate is easily attacked by symbolic execution and has the problem of small symbolic variable.To solve the above problems,combined with symbolic variable and array,this paper designs the conditional expression of inequality by single array nesting and modulo add operation of symbolic variable,based on which an algorithm for constructing opaque predicate without size constraints is proposed.The opaque predicate obfuscation based on the proposed algorithm can incur not only false negative but also false positive issues to attackers,which effectively defends against symbolic execution attacks.Besides,the potency,resilience and cost of the program obfuscated by opaque predicate without size constraints are experimentally tested and analyzed by measuring procedures such as opaque predicate detection,bogus control flow removal and so on.Experimental results show that the opaque predicate obfuscation based on the proposed algorithm not only demonstrates excellent potency and efficient cost,but also has high resilience to anti-deobfuscation in new test environment. | |
| dc.language.iso | ZH | |
| dc.publisher | Editorial office of Computer Science | |
| dc.subject.lcc | Computer software | |
| dc.title | Opaque Predicate Construction Algorithm Without Size Constraints | |
| dc.type | Article | |
| dc.description.keywords | opaque predicate|symbolic memory|array nesting|code obfuscation|symbolic execution | |
| dc.description.pages | 352-358 | |
| dc.description.doi | 10.11896/jsjkx.220600149 | |
| dc.title.journal | Jisuanji kexue | |
| dc.identifier.oai | f575421a21f9489ca2cd1e44469cccf8 | |
| dc.journal.info | Volume 50, Issue 8 | |
