期刊文献+

跨语言的项目级代码混淆方法

CROSS-LANGUAGE CODE OBFUSCATION AT A PROJECT LEVEL
下载PDF
导出
摘要 代码混淆作为一种保留语义的代码变换技术,在解释性语言和脚本语言的源代码保护中得到了广泛应用。随着软件项目越来越复杂,一个项目由多种语言共同编写,传统的代码混淆技术主要针对局部逻辑混淆,无法对不同类型的代码进行全局混淆,当一个子系统的代码混淆后,可能导致整个软件系统无法组装运行。设计跨语言的代码元素及其关联关系的描述规则,以统一的方式描述同一项目中不同类型的代码元素以及它们之间的关联关系,将相互关联的代码对应起来。提出跨语言的项目级代码混淆方法,实现对不同类型代码的全局混淆以及代码关联关系的自动化维护,并在真实的基于Struts2框架的源代码项目中进行混淆实验,说明所提方法及技术的可行性和有效性。 protection written in As a semantic-preserving code conversion technology, the code obfuscation is widely used in source code for interpretive languages and scripting languages. As software projects is getting complex, a project is usually multiple languages. The traditional code obfuscation technology which targets the local logic obfuscation cannot implement global obfuscation for different types of code. When the code of a sub-system is obfuscated, it may lead that the entire software system cannot be assembled to run. This paper designs description rules of cross-language code elements and the association between them, thus supporting the correspondence between interrelated code elements. We propose the method of cross-language code obfuscation at a project level which realizes global obfuscation for different types of code and the automatic maintenance of the code association, and do the confusing experiments on real source code projects which based on Struts2 framework to verify the feasibility and effectiveness of the method and technology.
出处 《计算机应用与软件》 北大核心 2018年第1期15-20,43,共7页 Computer Applications and Software
基金 上海市科技发展基金项目(16JC1400801)
关键词 代码混淆 跨语言 关联关系 STRUTS2 Code obfuscation Cross-language Association Struts2
  • 相关文献

参考文献3

二级参考文献25

  • 1Yu Fang, Chen Zhifeng, Diao Yanlei et al. Fast and memory-efficient regular expression matching for deep packet in spection//Proceedings of the IEEE/ACM ANCS. San Jose California, 2006:93-102.
  • 2Kumar S, Dharmapurikar S, Yu F et al. Algorithms to accelerate multiple regular expressions matching for deep pack et inspection//Proceedings of the ACM SIGCOMM. Pisa, Italy, 2006:339-350.
  • 3Becchi M, Cadambi S. Memory-efficient regular expression search using state merging/ /Proceedings of the IEEE Infocom. Anchorage, Alaska, 2007:1064-1072.
  • 4Kumar S, Chandrasekaran G, Turner Jet al. Curing regular expressions matching from insomnia, amnesia and acalculia// Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems. Orlando, Florida, USA, 2007. 155-164.
  • 5Becchi M, Crowley P. A hybrid finite automaton for practical deep packet inspection//Proceedings of the ACM CoNEXT. New York, 2007:1-12.
  • 6Smith Randy, Estan Cristian, Jha Somesh et al. Fast signature matching using extended finite automaton(XFA)//Proceedings of the ICISS Hyderabad. India, 2008. 158 -172.
  • 7Kong Shijin, Smith Randy, Estan Cristian. Efficient signature matching with multiple alphabet compression tables// Proceedings of the 4th International Conference on Security and Privacy in Communication Netowrks. Istanbul, Turkey, 2008.- 1-10.
  • 8Ficara D, Giordano S, Procissi G et al. An improved DFA for fast regular expression matching. ACM SIGCOMM Computer Communication Review, 2008, 38(5) : 29-40.
  • 9Kumar S, Turner J, Williams J. Advanced algorithms for fast and scalable deep packet inspection//Proceedings of the IEEE/ACM ANCS. San Jose, California, 2006. 81-92.
  • 10Becchi M, Cadambi S. An improved algorithm to accelerate regular expression evaluation//Proceedings of the IEEE/ ACM ANCS. Orlando, Florida, 2007:145-154.

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部