摘要
提出一种基于深度优先搜索的数据迷乱算法,将数据库中的原始数据通过DFS算法生成邻居关系树,找出生成树中边缘距离最小的路径作为原始数据的替代.对于原始数据中含有相同元素的特殊情况,提出了多种数据迷乱算法并行使用的技术以实现数据项的迷乱.此算法的提出突破了原有数据迷乱技术的简单数据变形,大大增加了攻击者逆向工程的复杂度以达到联机信息保护的目的.
This paper put forward a data obfuscation algorithm based on Depth First Searching. This algorithm create neighborhood tree through DFS algorithm and choose the nearest edge distance path in DFS Spanning tree, than substitute the original data with the data from nearest path. With regard to the identical data items, this paper use wide ranges of approaches concurrently for obfuscating the database . This algorithm break through simple data distortion of original obfuscation techniques and strengthen the complexity of reverse engineering for protecting the information.
出处
《微电子学与计算机》
CSCD
北大核心
2010年第2期49-54,共6页
Microelectronics & Computer
